Chapter PDF
References
Arnold, A & M. Dauchet [1976] Bi-transductions de forets, "Automata, Languages and Programming" (edited by S. Michaelson & R. Milner), Edinburgh University Press, 74–86.
Eilenberg, S. [1974] "Automata, Languages, and Machines," Vol. A, Academic Press.
Elgot, C.C. & J.E. Mezei [1965] On relations defined by generalized finite automata, IBM J. Res. Develop. 9, 47–68.
Engelfriet, J. [1975] Bottom-up and top-down tree transformations—a comparison, Math. Systems Theory 9, 198–231.
Ginsburg, S. & S.A. Greibach [1969] Abstract families of languages, Memoirs of AMS, no. 87, 1–32.
Knuth,D.E. [1968] "The Art of Computer Programming," Vol.1, Addison Wesly.
Nivat, M. [1968] Transductions des langages de Chomsky, Annales de l'Institut Fourier 18, 339–456.
Takahashi, M. [1975] Generalizations of regular sets and their application to a study of context-free languages, Information and Control 27, 1–36.
Thatcher, J.W. & J.B. Wright [1968] Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory 2, 57–81.
Thatcher,J.W. [1969] Generalized2 sequential machine maps, IBM Res. Report RC2466.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takahashi, M. (1977). Rational relations of binary trees. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_41
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive