Skip to main content
SpringerLink
Log in

Deterministic languages and non-generators

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

Included in the following conference series:

  • 132 Accesses

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

V Bibliography

  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. Berstel J.: Transductions and Contxt-Free Languages. Teubner Verlag (1979).

    Google Scholar 

  3. Boasson L.: Un Langage Algébrique Particulier. RAIRO Informatique Théorique 13 (1979) p.203–215.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UER de Mathématiques et Informatique, Université Paris 7, 2 Place Jussieu, 75005, Paris, France

    L. Boasson

  2. 15 Résidence des Gemeaux, 94260, Fresnes, France

    A. Petit

Authors
  1. L. Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boasson, L., Petit, A. (1984). Deterministic languages and non-generators. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023993

Download citation

  • DOI: https://doi.org/10.1007/BFb0023993

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation