Skip to main content
SpringerLink
Log in
Book cover

Theoretical Computer Science pp 64–69Cite as

Un resultat de discontinuite dans les familles de langages

  • Conference paper
  • First Online:

  • 103 Accesses

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

Abstract

There exists an a-cylinder (resp. a cylinder), i.e. a family closed under inverse gsm mapping (resp. inverse homomorphism) and intersection with regular sets, which is minimal in the sense : no a-cylinder (resp. cylinder) lies between it and the family of all regular sets. We construct an infinite hierarchy of nested a-cylinders such that only a finite number of distinct a-cylinders lie between two of them (such a result is unlikely for full-AFLs or rational cones).

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.

Références

  1. Autebert, J.-M.: Cylindres de languages algébriques, Thèse de Doctorat d'Etat, 1978, Paris.

    Google Scholar 

  2. Autebert, J.-M.: Opérations de cylindres et applications séquentielles gauches inverses, Acta Informatica, 11 (1979) p 241–258.

    Article  Google Scholar 

  3. Autebert, J.-M., J. Beauquier, L. Boasson et M. Latteux: Very small families of algebraic non rational languages, Formal Languages Theory: Perspectives and open problems, R.V. Book (ed.), to be published by Academic Press.

    Google Scholar 

  4. Autebert, J.-M. et L. Boasson: Generators of cones and cylinders, in Formal Languages Theory: Perspectives and open problems, R.V. Book (ed.), to be published by Academic Press.

    Google Scholar 

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

  6. Berstel, J.: Transductions and Context-Free Languages, Teubner Verlag, 1979, Stuttgart.

    Google Scholar 

  7. Ginsburg, S.: Formal languages: Algebraic and Automata — Theoretic Properties, North-Holland, 1975.

    Google Scholar 

  8. Greibach, S.: Chains of full-AFLs, Mathematical Systems Theory, 4 (1970) p 231–242.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Informatique Théorique et Programmation 104, T. 55-65, 2 Place Jussieu, 75221, Paris Cedex 05 (F)

    Jean-Michel Autebert

Authors
  1. Jean-Michel Autebert
    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

Autebert, JM. (1981). Un resultat de discontinuite dans les familles de langages. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017297

Download citation

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

  • 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