Abstract
The class DTT DR (respectively, DTT) is the family of all deterministic top-down tree transductions with deterministic top-down look-ahead (respectively, no look-ahead). In this paper we prove that the two hierarchies: (DTT DR)n and (DTT DR)n o DTT are proper and that they “shuffle perfectly” in the sense that (DTT DR)n o DTT is properly contained in (DTT DR)n*1, for all n ≥ 0. Using these results we show that the problem of determining the correct inclusion relationship between two arbitrary compositions of tree transformation classes from the set M= {DTA, DTT, DTT DR, DTT R} can be decided in linear time.
On leave from Research Group on Theory of Automata, Hungarian Academy of Sciences, supported by a grant from the Soros Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. V. Book, Confluent and other types of Thue systems, J. Assoc. Comput. Mach. 29 (1982) 171–182.
R. V. Book, Thue systems and the Church-Rosser property: replacement systems, specification of formal languages and presentations of monoids, L. Cummings (ed.) Progress in combinatorics on words 1–38, Academic Press, 1983, New York.
V. Book and P. O'Dunlaing, Testing for the Church-Rosser property, Theoret. Comput. Sci. 16 (1981) 223–229.
J. Engelfriet, Bottom-up and top-down tree transformations — a comparison, Mathematical Systems Theory 9 (1975) 198–231.
J. Engelfriet, Top-down tree transducers with regular look-ahead, Mathematical Systems Theory, 10 (1976/1977) 289–303.
J. Engelfriet and H. Vogler, Macro tree transducers, J. Comput. System Sci. 31 (1985) 71–146.
J. Engelfriet and H. Vogler, Pushdown machines for the macro tree transducer, Theoret. Comput. Sci. 42 (1986) 251–368.
J. Engelfriet and H. Vogler, High level tree transducers and iterated pushdown transducers, Acta Inform. 26 (1988) 131–192.
Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with determinstic top-down look-ahead, Inform. Process. Lett. 33 (1989/90) 3–5.
Z. Fülöp and S. Vágvölgyi, Variants of top-down tree transducers with look-ahead, Mathematical Systems Theory 21 (1989) 125–145.
Z. Fülöp and S. Vágvölgyi, Iterated deterministic top-down look-ahead, Fundamentals of Computation Theory International Conference FCT'89 Lecture Notes in Computer Science 380 (1989) 175–184.
Z. Fülöp and S. Vágvölgyi, Decidability of the inclusion in monoids generated by tree transformation classes, M. Nivat and A. Podelski (eds.) Tree automata and Languages 1992, Elsevier Science Publishers B.V. 381–408.
F. Gécseg and M. Steinby, Tree automata, Akadémiai Kiadó, 1984, Budapest.
M. Jantzen, Confluent string rewriting, Springer-Verlag, 1988, Berlin-Heidelberg-New York.
W. C. Rounds, Map**s and grammars on trees, Math. Systems Theory 4 (1970) 257–287.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Slutzki, G., Vágvölgyi, S. (1993). A hierarchy of deterministic top-down tree transformations. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive