Skip to main content
SpringerLink
Log in

Familles de langages translatables et fermées par crochet

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper is a sequel to a paper by Boasson and Nivat “Sur diverses familles de langages fermées par transduction rationnelle” [1] and uses in a crucial way the main result of [1]. Greibach in two papers [7, 8] has proved many AFL's to be non principal using a number of similar lemmas the prototype of which appears in [7] and concerns the substitution of one semi AFL in another semi AFL. All the AFL's dealt with in this manner are closed under some binary operation.

In these pages we study two unary operators on families of languages, translation and closure under bracket for which we establish lemmas similar to the lemmas of Greibach. We can thus prove some well known AFL's to be non principal.

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., Nivat, M.: Sur diverses familles de langages fermées par transduction rationnelle. Acta Informatica 2, 180–188 (1973)

    Google Scholar 

  2. Crestin, J. B.: Sur un langage quasi-rationnel d'ambiguité non bornée. Thèse de 3ème cycle. Faculté des Sciences de Toulouse 1967 (miméographiée)

  3. Elgot, C., Mezei, J.: On relations defined by generalized finite automata. IBM Journal of R. and D. 9, 47–68 (1965)

    Google Scholar 

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

    Google Scholar 

  5. Ginsburg, S., Spanier, E.: Finite turn push-down automata. SIAM J. Control 4, 429–453 (1966)

    Google Scholar 

  6. Ginsburg, S., Greibach, S.: Principal AFL. J. Computer and System Sciences 4, 308–338 (1970)

    Google Scholar 

  7. Greibach, S.: Chains of full AFL's. Math. Systems Theory 4, 231–242 (1970)

    Google Scholar 

  8. Greibach, S.: Syntactic operators on full semi AFL's. J. Computer and System Sciences 6, 30–76 (1972)

    Google Scholar 

  9. Goldstine, J.: Substitution and bounded languages. J.Computer and System Sciences 6, 9–29 (1972)

    Google Scholar 

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

    Google Scholar 

  11. Nivat, M.: Transductions des langages de Chomsky, Chapitre VI. Thèse de doctorat, Paris 1967 (miméographiée)

Download references

Author information

Authors and Affiliations

  1. Univ. Paris VII UER de Mathematique, F-Paris V, France

    L. Boasson

  2. E.N.S.T.A., 32 Bd Victor, F-Paris XV, France

    J. P. Crestin

  3. 9 Rue Portalis, F-Paris VIII, France

    M. Nivat

Authors
  1. L. Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. P. Crestin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Nivat
    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

Boasson, L., Crestin, J.P. & Nivat, M. Familles de langages translatables et fermées par crochet. Acta Informatica 2, 383–393 (1973). https://doi.org/10.1007/BF00289506

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation