Abstract
This communication is devoted to disprove three conjectures on families of context-free languages. The technique used consists in encoding simple context-free languages over infinite alphabets. The same technique allows to give a general result which shades a new light on the non-generators' family as well as on the power of the operation of substitution.
Preview
Unable to display preview. Download preview PDF.
Bibliographie
Autebert J.M., Beauquier J., Boasson L.: Languages over Infinite Alphabets Discrete Applied Math.2(1980) p.1–20.
Autebert J.M., Beauquier J., Boasson L., Nivat M.: Quelques Problèmes Ouverts en Théorie des Langages Algébriques. R.A.I.R.O Info. Théorique 13 (1979) p. 363–379.
Beauquier J.: Générateurs Algébriques et Systèmes de Paires Itérantes. Theoretical Computer Science 8 (1979) p. 293–323.
Berstel J.: Transductions and Context-free Languages. Teubner (Stuggart) 1979.
Boasson L.: The Inclusion of the Substitution Closure of Linear and One Counter Languages in the Largest full Sub-AFL of the CFL's is Proper. Information Proc. Letter 2 (1973) p. 135–140.
Boasson L., Crestin J.P., Nivat M.: Familles de Langages Translatables et Fermées par Crochet. Acta Informatica 2(1973) p. 383–393.
Boasson L., Nivat M.: Parenthesis Generators 17 th Annual FOCS, Houston (1976) p. 253–257.
Frougny C.: Langages très Simples Générateurs. RAIRO Info. Théorique 13 (1979) p. 69–86.
Greibach S.: Chains of Full AFL's Math. System Theory 4 (1970) p. 231–242.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boasson, L. (1981). Some applications of CFL's over infinite alphabets. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017306
Download citation
DOI: https://doi.org/10.1007/BFb0017306
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive