Non-erasing variants of the Chomsky-Schützenberger theorem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7410 LNCS, Issue , 2012, Pages 121-129

  Okhotin, Alexander ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC THEORIES; DYCK LANGUAGE;

ARTIFICIAL INTELLIGENCE;

CONTEXT FREE LANGUAGES;

EID: 84864982545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31653-1_12     Document Type: Conference Paper

References (7)

1. Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, Hirschberg (eds.) Computer Programming and Formal Systems, pp. 118-161. North-Holland, Amsterdam (1963)
2. Engelfriet, J.: An elementary proof of double Greibach normal form. Information Processing Letters 44(6), 291-293 (1992)
3. Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill (1966)
4. Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley (1978)
5. Lallement, G.J.: Semigroups and Combinatorial Applications. John Wiley and Sons (1979)
6. Rozenkrantz, D.J.: Matrix equations and normal forms for context-free grammars. Journal of the ACM 14(3), 501-507 (1967)
7. Salomaa, A.: Formal Languages. Academic Press (1973)