Abstract
We investigate Finite Tree-Transducers operating top-down, bottom-up or both ways simultaneously. A comparative study of their transductional power is given. Syntax-Connected Transductions extending Syntax-Directed Transductions are investigated. Various types of transductions of local forests defined by Syntax-Connected Transduction Schemes can be performed by Finite Tree-Transducers.
Chapter PDF
Similar content being viewed by others
References
ENGELFRIET, J.: Bottom-up and Top-Down Tree Transducers-a comparison. Memorandum No. 19, 1971 Techn. Hogeschool Twente, Netherlands
ROUNDS, W.C.: Mappings and grammars on trees. MST 4, 257–287 (1970)
SCHREIBER, P.P.: Baum-Transduktoren (Thesis forthcoming)
SCHREIBER, P.P.: Operational Automata for Compiler Design. Bericht Nr. 75–13. Technische Universität Berlin, FB 20-Kybernetik
THATCHER, J.W.: Generalized2 Sequential Machine Maps. JCSS 4, 339–367 (1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schreiber, P.P. (1975). Tree-transducers and syntax-connected transductions. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive