Skip to main content
SpringerLink
Log in
Book cover

Theoretical Computer Science pp 146–151Cite as

Some applications of CFL's over infinite alphabets

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 104))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. Autebert J.M., Beauquier J., Boasson L.: Languages over Infinite Alphabets Discrete Applied Math.2(1980) p.1–20.

    Article  Google Scholar 

  2. 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.

    Google Scholar 

  3. Beauquier J.: Générateurs Algébriques et Systèmes de Paires Itérantes. Theoretical Computer Science 8 (1979) p. 293–323.

    Article  Google Scholar 

  4. Berstel J.: Transductions and Context-free Languages. Teubner (Stuggart) 1979.

    Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. Boasson L., Crestin J.P., Nivat M.: Familles de Langages Translatables et Fermées par Crochet. Acta Informatica 2(1973) p. 383–393.

    Article  Google Scholar 

  7. Boasson L., Nivat M.: Parenthesis Generators 17 th Annual FOCS, Houston (1976) p. 253–257.

    Google Scholar 

  8. Frougny C.: Langages très Simples Générateurs. RAIRO Info. Théorique 13 (1979) p. 69–86.

    Google Scholar 

  9. Greibach S.: Chains of Full AFL's Math. System Theory 4 (1970) p. 231–242.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique et Programmation, France

    L. Boasson

Authors
  1. L. Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Deussen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation