Advertisement

Reducing algebraic tree grammars

  • B. Leguy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)

Keywords

Language Theory Deterministic Case Context Free Grammar Tree Language Terminal Symbol 
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.

References

  1. [1]
    A. ARNOLD, M. DAUCHET, “Forêts algébriques et homomorphismes inverses”, Information and Control. 37 (1978), pp. 182–196.Google Scholar
  2. [2]
    A. ARNOLD, M. DAUCHET, “Théorie des magmoïdes”, RAIRO inf. th. 12 (1978), no 3, pp. 235–257 et 13 (1979), no 2, pp. 135–154.Google Scholar
  3. [3]
    G. BOUDOL, “Langages polyadiques algébriques. Théorie des schémas de programme: Sémantique de l'appel par valeur”, Thèse de 3 ème cycle, Paris VII (1975).Google Scholar
  4. [4]
    B. COURCELLE, “A representation of trees by languages”, Th. Comput. Sci. 6 (1978), pp. 255–279 and 7 (1978) pp. 25–55.Google Scholar
  5. [5]
    J. ENGELFRIET and E.M. SCHMIDT, “IO and OI”, J. Comput. System Sci. 15 (1977), pp. 328–353 and 16 pp. 67–99.Google Scholar
  6. [6]
    J. ENGELFRIET, “Some open questions and recent results on tree tranducers and tree languages”, Formal Language Theory edited by R.V. BOOK. Academic Press 1980.Google Scholar
  7. [7]
    I. GUESSARIAN, “Program transformation and algebraic semantics”, Publication interne LITP 78/21 (1978), A paraître dans TCS.Google Scholar
  8. [8]
    B. LEGUY, “Reductions, transformations et classification des grammaires algébriques d'arbres”, Thèse de 3 ème cycle, Lille (1980).Google Scholar
  9. [9]
    B. LEGUY, “Grammars without erasing rules. The OI case”. C.A.A.P. 1981, Genova (Italy).Google Scholar
  10. [10]
    M. NIVAT, “On the interpretation of recursive program schemes”, Rapport IRIA, no 84 (1974).Google Scholar
  11. [11]
    W.C. ROUNDS, “Mappings and grammars on trees”, Math. Systems theory. 4 (1968), pp. 257–287.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • B. Leguy
    • 1
  1. 1.Equipe lilloise d'Informatique théorique et de ProgrammationUniversité de Lille IFrance

Personalised recommendations