Deterministic languages and non-generators

  • L. Boasson
  • A. Petit
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)


This communication is devoted to the proof of the following results: the family of context-free non-generators cannot be principal with a deterministic generator. A similar result holds for the largest sub-cone of linear languages as well as of one-counter languages.


Iterative Factor Principal Cone Longe Prefix Linear Language Deterministic Language 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

V Bibliography

  1. 1.
    Beauquier J.: Générateurs Algébriques et Systèmes de Paires Itérantes. T.C.S. 8 (1979) p. 293–323.Google Scholar
  2. 2.
    Berstel J.: Transductions and Contxt-Free Languages. Teubner Verlag (1979).Google Scholar
  3. 3.
    Boasson L.: Un Langage Algébrique Particulier. RAIRO Informatique Théorique 13 (1979) p.203–215.Google Scholar
  4. 4.
    Greibach S.: Chains of full AFL's. Math. System Theory 4 (1970) p.231–242.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • L. Boasson
    • 1
  • A. Petit
    • 2
  1. 1.UER de Mathématiques et InformatiqueUniversité Paris 7ParisFrance
  2. 2.FresnesFrance

Personalised recommendations