Advertisement

Derivations et reductions dans les grammaires algebrioues

  • L. Boasson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

Keywords

Formal Language Deterministic Language Abstract Family Alphabet Terminal Vations Directes 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. [1]
    AHO A.V. and J.D. ULLMAN: The Theory of Parsing, Translation and Compiling. Prentice-Hall (1972).Google Scholar
  2. [2]
    AUTEBERT J.M.: Non-Principalité du Cylindre des Langages à Compteur. Math.System Theory 11 (1977), p. 157–167.Google Scholar
  3. [3]
    BERSTEL J.: Congruences Plus que Parfaites et Langages Algébriques. Séminaire d'Informatique Théorique. L.I.T.P. (1975–77) p. 123–147.Google Scholar
  4. [4]
    BOASSON L.: Un Langage Particulier. R.A.I.R.O. — Informatique Théorique 13 (1979), p. 203–215.Google Scholar
  5. [5]
    BOASSON L. et M. NIVAT: Parenthesis Generators. 17th Annual I.E.E. Symposimm (F.O.C.S.) (1976), p. 253–257.Google Scholar
  6. [6]
    BURSTALL R. and J. DARLINGTON: A Transformation System for Developping Recursive Programs. Jour. of A.C.M. 24 (1977), p. 44–67.Google Scholar
  7. [7]
    BUTZBACH P.: Une famille de Congruences de Thue pour lesquelles l'Equivalence est Décidable. 1st I.C.A.L.P. North-Holland (1973) p. 3–12.Google Scholar
  8. [8]
    CHANDLER W.J.: Abstract Families of Deterministic Languages. 1st A.C.M. S.I.G.A.C.T. (1969), p. 21–30.Google Scholar
  9. [9]
    COCHET Y. et M. NIVAT: Une Généralisation des Ensembles de Dyck. Israel Jour. of Math. 9 (1971), p. 389–395.Google Scholar
  10. [10]
    FROUGNY C.: Langages très simples Générateurs. R.A.I.R.O. Informatique Théorique 13 (1979), p. 69–86.Google Scholar
  11. [11]
    GINSBURG S. and S.A. GREIBACH: Abstract Families of Languages. Memoirs of the Amer. Math. Soc. 87 (1969), p. 1–32.Google Scholar
  12. [12]
    GINSBURG S. and M. HARRISON: Bracketed Context-Free Languages. Jour. of Computer and System Science 1 (1967), p. 1–23.Google Scholar
  13. [13]
    GREIBACH S.A.: Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science 36 (1975), Springer.Google Scholar
  14. [14]
    GREIBACH S.A.: One-Counter Languages and the I.R.S. Condition. Jour. of Computer and System Science 10 (1975), p. 237–247.Google Scholar
  15. [15]
    GREIBACH S.A. and S. GINSBURG: Multitape A.F.A. Jour. of A.C.M. 19 (1972), p. 193–221.Google Scholar
  16. [16]
    HOPCROFT J. and J.D. ULLMAN: Formal Languages and their Relationship to Automata. Addison-Wesley (1969).Google Scholar
  17. [17]
    HOTZ G.: Uber die Darstellbarkeit des Syntaktischen Monoides Kontext-Freier Spracher. Rapport de l'Université de Saarbruck.Google Scholar
  18. [18]
    KOTT L.: About a Transformation System: a Theoretical Study. 3ème Colloque International sur la Programmation. Paris (1978), B. Robinet Ed.Google Scholar
  19. [19]
    Mc NAUGHTON R.: Parenthesis Grammars. Jour. of A.C.M. 14 (1967), p. 490–500.Google Scholar
  20. [20]
    SALOMAA A.: Formal Languages. Academic Press (1973).Google Scholar
  21. [21]
    STANAT D.F.: Formal Languages and Power Series. 3rd A.C.M. S.I.G.A.C.T. (1971) p. 1–11.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • L. Boasson
    • 1
    • 2
  1. 1.U.E.R. de MathématiquesUniversité Paris VIIItaly
  2. 2.L.A. 248 du C.N.R.S. "Informatique Théorique et Programmation"Italy

Personalised recommendations