Abstract
There is a simple language S such that every realtime context-free language can be obtained by an inverse g.s.m. mapping from S. Hence the family of realtime context-free languages is a principal A.F.D.L.
We show here that the cylinder (closure under inverse homomorphism and intersection with regular sets) of realtime languages is principal and then we get easily the result.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.M. AUTEBERT Non-principalité du cylindre des langages à compteur. à paraître dans Mathematical Systems Theory
L. BOASSON et M. NIVAT Le cylindre des languages linéaires n'est pas principal 2.G.I. Fachtagung Automaten Theorie und Formale Sprachen (1975) p 16–19
S. GREIBACH The hardest Context-Free language S.I.A.M. Journal 2 (1973) p 304–310
S. GREIBACH Jump PDA's and hierarchies of deterministic Context-Free languages. S.I.A.M. Journal 3 (1974) p 111–127
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Autebert, J.M. (1977). Cylindres de langages simples et pseudo-simples. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_13
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive