Abstract
Macro tree transducers can simulate most models of tree transducers (e.g., top-down and bottom-up tree transducers, attribute grammars, and pebble tree transducers which, in turn, can simulate all known models of XML transformers). The string languages generated by compositions of macro tree transducers (obtained by reading the leaves of the output trees) form a large class which contains, e.g., the IO hierarchy and the EDT0L control hierarchy. Consider an arbitrary composition τ of (deterministic) macro tree transducers. How dificult is it, for a given input tree s, to compute the translation t = τ (s)? It is shown that this problem can be solved (on a RAM) in time linear in the sum of the sizes of s and t. Moreover, the problem to determine, for a given t of size n, whether or not there is an input tree s such that t = τ (s) is in DSPACE(n); this means that output languages of compositions of macro tree transducers are deterministic context-sensitive. The involved technique of compressing intermediate results of the composition, also gives a new proof of the fact that the finiteness problem for τ ’s range is decidable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P.R.J. Asveld. Time and space complexity of inside-out macro languages. Internat. J. Comput. Math., 10:3–14, 1981.
B. S. Baker. Generalized syntax directed translation, tree transducers, and linear space. SIAM J. Comput., 7(3):376–391, 1978.
B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. TCS, 17:163–191 and 235–257, 1982.
W. Damm. The IO-and OI-hierarchies. TCS, 20:95–207, 1982.
F. Drewes and J. Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1–50, 1998.
P. Deransart, M. Jourdan, and B. Lorho. Attribute Grammars, Definitions and Bibliography. Number 323 in LNCS. Springer-Verlag, 1988.
J. Engelfriet and S. Maneth. Work in progress.
J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput., 154:34–91, 1999.
J. Engelfriet and S. Maneth. Output string languages of compositions of deterministic macro tree transducers. JCSS, 64(2):350–395, 2002.
J. Engelfriet. Bottom-up and top-down tree transformations–a comparison. Math. Systems Theory, 9(3):198–231, 1975.
J. Engelfriet. The complexity of languages generated by attribute grammars. SIAM J. Comput., 15(1):70–86, 1986.
J. Engelfriet and H. Vogler. Macro tree transducers. JCSS, 31:71–146, 1985.
M.J. Fischer. Grammars with macro-like productions. PhD thesis, Harvard University, Massachusetts, 1968.
Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261–279, 1981.
Z. Fülöp and H. Vogler. Syntax-Directed Semantics-Formal Models based on Tree Transducers. EATCS Monographs on Theoretical Computer Science (W. Brauer, G. Rozenberg, A. Salomaa, eds.). Springer-Verlag, 1998.
F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
D.E. Knuth. Semantics of context-free languages. Math. Systems Theory, 2:127–145, 1968. (Corrections in Math. Systems Theory, 5:95–96, 1971).
A. Kühnemann. Benefits of tree transducers for optimizing functional programs. In V. Arvind and R. Ramanujam, editors, Proc. FST&TCS’98, volume 1530 of LNCS, pages 146–157. Springer-Verlag, 1998.
T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In Proc. PODS’2000, pages 11–22. ACM Press, 2000.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
V. Vianu. A Web Odyssey: From Codd to XML. In Proc. PODS’2001, pages 1–15. ACM Press, 2001.
H. Vogler. Functional description of the contextual analysis in blockstructured programming languages: a case study of tree transducers. Science of Computer Programming, 16(3):251–275, 1991.
P. Wadler. Deforestation: Transforming programs to eliminate trees. TCS, 73:231–248, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maneth, S. (2002). The Complexity of Compositions of Deterministic Tree Transducers. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive