Skip to main content
SpringerLink
Log in

Familles de langages fermees par crochet et crochet ouvert

  • Vorträge In Der Reihenfolge Des Programms
  • Conference paper
  • First Online:
Theoretical Computer Science

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

Abstract

In this paper we present a new unary operator, the open bracket, which resemble the operator bracket of [1]. We derive from it the characterization of some families of checking Automata Languages.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. BOASSON L., CRESTIN J.P., NIVAT M. Familles de Langages Translatables et Fermées par Crochet Acta Informatica 2, 383–393 (1973).

    Article  Google Scholar 

  2. BOASSON L., NIVAT M. Sur Diverses Familles de Langages Fermées par Transduction Rationnelle Acta Informatica 2, 180–188 (1973).

    Google Scholar 

  3. CRESTIN J.P. Sur un Langage quasi-rationnel d'ambiguīté non bornée Thèse de 3ème cycle — Faculté des Sciences de TOULOUSE (1967) (Miméographiée)

    Google Scholar 

  4. ELGOT C., MEZEI J. On Relations Defined by Generalized Finite Automata IBM Journal of R. and D. 9, 47–68 (1965).

    Google Scholar 

  5. GINSBURG S., GREIBACH S. Abstract Families of Languages Memoires Amer. Math. Soc. 87, 1–32 (1969).

    Google Scholar 

  6. GINSBURG S., GREIBACH S. Principal AFL J. Computer and System Sciences 4, 308–338 (1970).

    Google Scholar 

  7. GREIBACH S. An Infinite Hierarchy of Context-free Languages J. Assoc. Comput. Mach. 16, 91–106 (1969).

    Google Scholar 

  8. GREIBACH S. Checking Automata and One Way Stack Languages J. Computer and System Sciences 3, 196–217 (1969).

    Google Scholar 

  9. GREIBACH S. Chain of Full AFL's Math. Syst. Theory 4 no3, 231–242 (1970).

    Article  Google Scholar 

  10. GREIBACH S. Syntactic Operators on full semi AFL's J. Computer and System Sciences 6, 30–76 (1972).

    Google Scholar 

  11. NIVAT M. Transduction des Langages de Chomsky Annales de l'Institut Fourier 18, 339–456 (1968).

    Google Scholar 

  12. NIVAT M. Transduction des Langages de Chomsky Chapitre VI — These de Doctorat, Paris (1967) (Miméographiée).

    Google Scholar 

  13. RODRIGUEZ F. Une Hiérarchie Infinie de cônes d'Accepteurs Vérificateurs in 1. Fachtagung über Automatentheorie und Formale Sprachen, Lecture Notes in Computer Sciences, Springer Verlag, 81–87 (1973).

    Google Scholar 

  14. RODRIGUEZ F. Cônes d'Accepteurs — Application à l'étude d'une Hiérarchie Infinie de Cônes Rationnels de Langages d'Accepteurs Vérificateurs Thèse Docteur-Ingénieur, TOULOUSE (1973).

    Google Scholar 

  15. RODRIGUEZ F. Une Double Hiérarchie Infinie de Langages Vérifiables RAIR0 R1, 5–20, (1975).

    Google Scholar 

Download references

Authors
  1. F. Rodriguez
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodriguez, F. (1977). Familles de langages fermees par crochet et crochet ouvert. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-08138-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08138-8

  • Online ISBN: 978-3-540-37389-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation