This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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).
J. Engelfriet, Bottom-up and top-down tree transformation — a comparison, Math. System Theory, vol. 9 (1975) pp. 199–231.
J. Engelfriet, E.M. Schmidt, IO and OI, Report PB-47, Aarhus University, Danemark, (1975).
M. Fischer, Grammars with macro-like instructions, Proc. of the 9th Annual Symp. on Switching and Automata Theory (1968) pp. 131–142.
J.E. Hopcroft, A.J. Korenjak, Simple deterministic languages, Proc. of the 7th Symposium on Switching and Automata Theory, Berkeley (1966) pp. 36–46.
R. Hosseley, Finite tree automata and ω-automata, Report MAC TR-102 (1972).
W.C. Rounds, Mappings and grammars on trees, Math. Systems Theory 4 (1970) pp. 257–287.
L.G. Valiant, Decision procedures for families of deterministic push-down automata, Report no7, Computer Centre of Warwick University, Coventry, England (1973).
B. Courcelle, A Representation of Trees by Languages, submitted for publication.
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1977). On a description of tree-languages by languages. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_4
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_4
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