Advertisement

On a description of tree-languages by languages

  • B. Courcelle
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Courcelle, Sur les ensembles algébriques d'arbres et les langages déterministes, quelques applications à la théorie des schémas de programmes, Thèse, Université de Paris-7, (1976).Google Scholar
  2. [2]
    J. Engelfriet, Bottom-up and top-down tree transformation — a comparison, Math. System Theory, vol. 9 (1975) pp. 199–231.Google Scholar
  3. [3]
    J. Engelfriet, E.M. Schmidt, IO and OI, Report PB-47, Aarhus University, Danemark, (1975).Google Scholar
  4. [4]
    M. Fischer, Grammars with macro-like instructions, Proc. of the 9th Annual Symp. on Switching and Automata Theory (1968) pp. 131–142.Google Scholar
  5. [5]
    J.E. Hopcroft, A.J. Korenjak, Simple deterministic languages, Proc. of the 7th Symposium on Switching and Automata Theory, Berkeley (1966) pp. 36–46.Google Scholar
  6. [6]
    R. Hosseley, Finite tree automata and ω-automata, Report MAC TR-102 (1972).Google Scholar
  7. [7]
    W.C. Rounds, Mappings and grammars on trees, Math. Systems Theory 4 (1970) pp. 257–287.CrossRefGoogle Scholar
  8. [8]
    L.G. Valiant, Decision procedures for families of deterministic push-down automata, Report no7, Computer Centre of Warwick University, Coventry, England (1973).Google Scholar
  9. [9]
    B. Courcelle, A Representation of Trees by Languages, submitted for publication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • B. Courcelle

There are no affiliations available

Personalised recommendations