Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
BOASSON L. et M. NIVAT: Sur Diverses Familles de Langages Fermées par Transductions Rationnelles. Acta Informatica, 2, 180–188 (1973).
GINSBURG S.: The Mathematical Theory of Context-Free Languages. Mc Graw Hill (1966).
GREIBACH S.: Jump pda's, Deterministic Context-Free Languages, Principal AFDL's and Polynomial Time Recognition. Proc. of 5th Annual ACM Symposium on Theory of Computing, Austin, (Texas), 20–28 (1973).
GREIBACH S.: The Hardest Context-Free Language. Siam J. of Comput., 2, no4, 304–330 (1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boasson, L., Nivat, M. (1975). Le cylindre des langages lineaires n'est pas principal. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive