Abstract
The famous theorem by Chomsky and Schützenberger (“The algebraic theory of context-free languages”, 1963) states that every context-free language is representable as h(D k ∩ R), where D k is the Dyck language over \(k \geqslant 1\) pairs of brackets, R is a regular language and h is a homomorphism. This paper demonstrates that one can use a non-erasing homomorphism in this characterization, as long as the language contains no one-symbol strings. If the Dyck language is augmented with neutral symbols, the characterization holds for every context-free language using a letter-to-letter homomorphism.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Engelfriet, J.: An elementary proof of double Greibach normal form. Information Processing Letters 44(6), 291–293 (1992)
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill (1966)
Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley (1978)
Lallement, G.J.: Semigroups and Combinatorial Applications. John Wiley and Sons (1979)
Rozenkrantz, D.J.: Matrix equations and normal forms for context-free grammars. Journal of the ACM 14(3), 501–507 (1967)
Salomaa, A.: Formal Languages. Academic Press (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okhotin, A. (2012). Non-erasing Variants of the Chomsky–Schützenberger Theorem. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)