Abstract
An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time. Under call-by-value semantics, the new model is strictly more expressive than call-by-value macro tree transducers, and moreover, it has better closure properties under composition.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Engelfriet, J., Vogler, H.: Macro tree transducers. JCSS 31, 71–146 (1985)
Fülöp, Z., Vogler, H.: Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer, Heidelberg (1998)
Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: Principles of Database Systems (PODS), pp. 283–294 (2005)
Perst, T., Seidl, H.: Macro forest transducers. IPL 89, 141–149 (2004)
Rounds, W.C.: Mappings and grammars on trees. MST 4, 257–287 (1970)
Thatcher, J.W.: Generalized sequential machine maps. JCSS 4, 339–367 (1970)
Engelfriet, J., Vogler, H.: The translation power of top-down tree-to-graph transducers. JCSS 49, 258–305 (1994)
Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Inf. Contr. 11, 3–29 (1967)
Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39, 613–698 (2003)
Inaba, K., Hosoya, H.: Multi-return macro tree transducers. In: PLAN-X (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inaba, K., Hosoya, H., Maneth, S. (2008). Multi-Return Macro Tree Transducers. In: Ibarra, O.H., Ravikumar, B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70844-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-70844-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70843-8
Online ISBN: 978-3-540-70844-5
eBook Packages: Computer ScienceComputer Science (R0)