Skip to main content
SpringerLink
Log in

Langages saturés et cônes décroissants langages et cônes bifidèles

Saturated languages and decreasing cones bifaithful languages and bifaithful cones

  • Published:
Acta Informatica Aims and scope Submit manuscript

Résumé

C(ℒ) (resp.C d(−),C f(−)) est la plus petite famille de langages contenant ℒ et fermée par homomorphisme (resp. homomorphisme alphabétique, homomorphisme non effaçant), homomorphisme inverse (resp. homomorphisme strictement alphabétique inverse, homomorphisme inverse) et par intersection rationnelle.C d(−) etC f(−) sont donc des cônes restreints deC(−). Nous donnons des relations entre cônes restreints deC(−) etC(−). Ce qui nous permet de construire une hiérarchie infinie de langages algébriques non effaçables (L est effaçable ⇔C({L})=C f({L})).

Summary

C(ℒ) (resp.C d(−),C f(−)) is the smallest family of languages containing ℒ and closed under morphism (resp. alphabetic morphism, non erasing morphism), inverse morphism (resp. inverse alphabetic non erasing morphism, inverse morphism) and intersection with regular sets.C d(−) andC f(−) are restricted cones ofC(ℒ). We give relations between restricted cones ofC(ℒ) andC(ℒ), that allows us to construct an infinite hierarchy of no-erasable context-fee languages (L is erasable⇔C({L})=C f({L}))

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliographie

  1. Berstel, J.: Transductions and contexte-free languages. Teubner, Stuttgart 1979

    Google Scholar 

  2. Boasson, L.: Langages algébriques, paires itérantes et transductions rationnelles. Theoretical Computer Science2, 209–223 (1976)

    Google Scholar 

  3. Boasson, L., Nivat, M.: Sur diverses familles de langages fermées par transduction rationnelle. Acta Informatica2, 180–188 (1973)

    Google Scholar 

  4. Crestin, J.P.: Langages quasirationnels. Dans: Crestin, J.P., Nivat, M. (eds). Langages Algébriques. 1973, pp. 123–166

  5. Eilenberg, S.: Automata, languages and machines, Vol. A. Academic Press, New York 1974

    Google Scholar 

  6. Elgot, C.C., Mezei, J.F.: On relations defined by generalized finite automata. I.B.M. J. Res. Dev., vol.9, 47–68 (1965)

    Google Scholar 

  7. Ginsburg, S.: The mathematical theory of context-free languages. McGraw Hill, New York 1966

    Google Scholar 

  8. Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages. North-Holland, Amsterdam 1975

    Google Scholar 

  9. Ginsburg, S., Goldstine, J., Greibach, S.A.: Uniformly erasable AFL. J. Comput. System Sc.10, 165–182 (1975)

    Google Scholar 

  10. Ginsburg, S., Goldstine, J., Greibach, S.A.: Some uniformly erasable families of languages. Theoretical Computer Science2, 29–44 (1976)

    Google Scholar 

  11. Ginsburg, S., Greibach, S.A.: Abstract families of languages. Memoirs of the Amer. Math. Soc.87, 1–32 (1969

    Google Scholar 

  12. Greibach, S.A.: Chain of full AFL's. Math. Systems Theory4, 231–242 (1970)

    Google Scholar 

  13. Greibach, S.A.: Syntaxtic operators on full semi-AFLs. J. Comput. System Sci.6, 30–76 (1972)

    Google Scholar 

  14. Greibach, S.A.: Erasing in context-free AFLs. Information and Control21, 436–465 (1972)

    Google Scholar 

  15. Greibach, S.A.: Erasable Contexte-free Languages. Information and Control29, 301–326 (1975)

    Google Scholar 

  16. Latteux, M.: Générateurs algébriques et linéaires. Acta-Informat.13, 347–363 (1980)

    Google Scholar 

  17. Latteux, M.: A propos du lemme de substitution. Theor. Comput. Sci.14, 119–123 (1981)

    Google Scholar 

  18. Latteux, M.: Quelques propriétés des langages à un compteur. 5th GI-Conférence-Lecture Notes in Computer Science104. Springer, Berlin, Heidelberg, New York 1981

    Google Scholar 

  19. Latteux, M.: Effacement et langages algébriques. Dans: Les Actes du Colloque AFCET≪Les mathématiques de l'Informatique≫, 25–33 (1982)

  20. Latteux, M., Leguy, J.: Langages algébriques rationnellement saturés. Journées Internationales ≪Groupes et Langages≫, Amiens 1981 (à paraître dans les actes)

  21. Leguy, J.: Transductions rationnelles décroissantes. RAIRO, Informatique Théorique5, 141–148 (1981)

    Google Scholar 

  22. Leguy, J.: Transductions rationnelles décroissantes et substitution. Thèse, Lille 1980

  23. Leguy, J.: Deux nouvelles extensions du lemme de substitution. Dans: Actes du Colloque: Mathematics for Computer Science, Paris, 16–18 mars 1982, pp. 199–204

  24. Nivat, M.: Transductions des langages de Chomsky. Ann. Inst. Fourier (Grenoble)18, 339–455 (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lille I, U.E.R., I.E.E.A., B.P.36, F-59650, Villeneuve, France

    Jeannine Leguy

Authors
  1. Jeannine Leguy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leguy, J. Langages saturés et cônes décroissants langages et cônes bifidèles. Acta Informatica 18, 65–78 (1982). https://doi.org/10.1007/BF00625281

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation