Abstract
We show that for any context-free language L⊆T + there is a length-preserving ho-momorphism μ and a homomorphism λ such that L=(a ̅ D)a,b))λ -1 µ, where D(a, b) denotes the Dyck set over the alphabet {a, b}. λ and μ may be effectively constructed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
J. Berstel. Transductions and Context-Free Languages. B.G. Teubner, Stuttgart 1979.
N. Chomsky and M. Schützenberger. The algebraic theory of context-free languages, in : P. Braffort and D. Hirschberg (edts.). Computer programming and formal systems, North-Holland, Amsterdam 1963, 118–161.
S. Greibach. The hardest context-free languages . SI AM Journal of Computing 2 (1973) 304–310.
G. Hotz. A Representation Theorem of Infinite Dimensional Algebras and Applications to Language Theory. Journal of Computer and System Sciences 33 (1986) 423–455.
E. Shamir. A Representation Theorem For Algebraic and Context-Free Power Series in Noncommuting Variables. Information and Control 11 (1967) 239–254.
T. Yokomori. On Purely Morphic Characterizations of Context-Free Languages. Theoretical Computer Science 51 (1987) 301–308.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 B. G. Teubner Verlagsgesellschaft, Leipzig
About this chapter
Cite this chapter
Kretschmer, T. (1992). An Algebraic Characterization of Context-Free Languages. In: Buchmann, J., Ganzinger, H., Paul, W.J. (eds) Informatik. TEUBNER-TEXTE zur Informatik, vol 1. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-322-95233-2_12
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-8154-2033-1
Online ISBN: 978-3-322-95233-2
eBook Packages: Springer Book Archive