Un resultat de discontinuite dans les familles de langages
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).
KeywordsFormal Language Theory Mathematical System Theory Infinite Hierarchy Sont Encore Proposition Suivante
Unable to display preview. Download preview PDF.
- Autebert, J.-M.: Cylindres de languages algébriques, Thèse de Doctorat d'Etat, 1978, Paris.Google Scholar
- 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
- 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
- Berstel, J.: Transductions and Context-Free Languages, Teubner Verlag, 1979, Stuttgart.Google Scholar
- Ginsburg, S.: Formal languages: Algebraic and Automata — Theoretic Properties, North-Holland, 1975.Google Scholar