Skip to main content
SpringerLink
Log in

Sur diverses familles de langages fermées par transduction rationnelle

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The main theorem gives a sufficient condition for an AFL to be the closure under union of the set of images under rational transductions of any of its sets of generators. All the AFL's known to have this property satisfy the given condition. As an application we give a short proof of the fact that every generator of the AFL of algebraic (context-free) languages is a faithful generator, i.e. can be mapped onto every algebraic language by a faithful (& free) rational transduction.

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

Similar content being viewed by others

Bibliographie

  1. Boasson, L.: Cônes rationnels et familles agréables de langages. Application aux langages à compteur. Thèse de 3e cycle. Université de Paris VII, Paris 1971.

    Google Scholar 

  2. Boasson, L.: An iteration theorem for one-counter languages. 3rd Annual ACM Symposium on Theory of Computing, 116–120 (1971).

  3. Chomsky, N., Schützenberger, M. P.: The algebraic theory of context-free languages in computer programming and formal systems. Amsterdam: North Holland Publishing Co. 1963.

    Google Scholar 

  4. Eilenberg, S.: Communication au Congrès International des Mathématiciens, Nice, 1970.

  5. Ginsburg, S.: Communication privée.

  6. Ginsburg, S., Greibach, S.: Abstract families of languages in Memoirs of the American Math. Soc., n∘ 87 Providence, 1969.

  7. Ginsburg, S., Greibach, S.: Principal AFL. Jour. of Computer and System Sciences 4, 308–338 (1970).

    Google Scholar 

  8. Greibach, S.: Communication à International Symposium on Theory of Computation, Haïfa, 1971.

  9. Greibach, S.: A new formal form theorem for context-free phrase structure grammars. Jour. of the Association of Computing Machinery 12, 42–52 (1965).

    Google Scholar 

  10. Greibach, S.: Chain of full AFL's. Math. System Theory 4, 231–242 (1970).

    Google Scholar 

  11. Nivat, M.: Transductions des langages de Chomsky. Annales d l'Institut Fourrier 18, 339–456 (1968).

    Google Scholar 

  12. Nivat, M.: Graphes et transducteurs, in Théorie des graphes, Journées Internationales. Paris: Dunod 1966.

    Google Scholar 

  13. Ogden, W.: Helpful result for proving inherent ambiguity. Math. System Theory 2, 191–194 (1967).

    Google Scholar 

  14. Shamir, E.: A representation theorem for algebraic and context-free power series in non-commuting variates in algebraic theory of machines, languages and semi-groups, Academic Press, N.Y., 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématique, Université Paris VII, F-75005, Paris, France

    L. Boasson & M. Nivat

Authors
  1. L. Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Nivat
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Les auteurs tiennent à remercier le professeur S. Ginsburg, de l'Univerité USC de Los Angeles, des fructueuses discussions qu'ils ont pu avoir avec lui Mai et Juillet 1971.

Le deuxième auteur remercie très vivement l'Université de London (Ontario) et tout particulièrement le professeur Thierrin qui lui ont permis d'exposer ces résultats à l'Ecole d'Eté de Théorie des automates organisée par cette université de Mai à Juillet 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boasson, L., Nivat, M. Sur diverses familles de langages fermées par transduction rationnelle. Acta Informatica 2, 180–188 (1973). https://doi.org/10.1007/BF00264030

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation