论文信息 - A Note on the Emptiness of Intersection Problem for Left Szilard Languages

A Note on the Emptiness of Intersection Problem for Left Szilard Languages

As left Szilard languages form a subclass of simple deterministiclanguages and even a subclass of super-deterministic languages, weknow that their equivalence problem is decidable. In this note weshow that their emptiness of intersection problem is undecidable.The proof follows the lines of the correponding proof for simpledeterministic languages, but some technical tricks are needed. Thisresult sharpens the borderline between decidable and undecidableproblems in formal language theory.

Erkki Mäkinen

[1] Takashi Yokomori,et al. Polynomial-time identification of very simple grammars from positive data , 2003, Theor. Comput. Sci..

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] Sheila A. Greibach,et al. Superdeterministic PDAs , 1980, J. ACM.

[4] John E. Hopcroft,et al. Simple Deterministic Languages , 1966, SWAT.

[5] Jeffrey D. Ullman,et al. Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[6] Harry B. Hunt,et al. Decidability of equivalence, containment, intersection, and separability of context-free languages , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[7] Erkki Mäkinen,et al. On context-free derivations , 1985 .