论文信息 - A Structural Lemma for Deterministic Context-Free Languages

A Structural Lemma for Deterministic Context-Free Languages

We present a new structural lemma for deterministic context free languages. From the first sight, it looks like a pumping lemma, because it is also based on iteration properties, but it has significant distinctions that makes it much easier to apply. The structural lemma is a combinatorial analogue of KC-DCF-Lemma (based on Kolmogorov complexity), presented by Li and Vitanyi in 1995 and corrected by Glier in 2003. The structural lemma allows not only to prove that a language is not a DCFL, but discloses the structure of DCFLs Myhill-Nerode classes.

Alexander A. Rubtsov | A. Rubtsov

[1] Ming Li,et al. A New Approach to Formal Language Theory by Kolmogorov Complexity , 1995, SIAM J. Comput..

[2] Jeffrey Shallit,et al. A Second Course in Formal Languages and Automata Theory , 2008 .

[3] OLIVER GLIER. Kolmogorov Complexity and Deterministic Context-Free Languages , 2003, SIAM J. Comput..

[4] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[5] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

[7] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[8] Andrzej Ehrenfeucht,et al. Strong Iterative Pairs and The Regularity of Context-Free Languages , 1985, RAIRO Theor. Informatics Appl..

[9] S. Yu,et al. A Pumping Lemma for Deterministic Context-Free Languages , 1989, Inf. Process. Lett..

[10] Luc Boasson,et al. Un critère de rationnalité des langages algébriques , 1972, ICALP.