Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations

Theoretical Computer Science

Volumn 156, Issue 1-2, 1996, Pages 71-97

  Gyenizse, Pál ^a   Vágvölgyi, Sándor ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES; MATHEMATICAL TRANSFORMATIONS; SET THEORY; TREES (MATHEMATICS);

BOTTOM UP TREE TRANSFORMATION; HOMOMORPHISM; REGULAR LOOK AHEAD; TOP DOWN TREE TRANSFORMATION;

COMPUTATION THEORY;

EID: 0030109672     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00303-3     Document Type: Article

References (15)

1. J. Engelfriet, Bottom-up and top-down tree transformations - a comparison, Math. Systems Theory 9 (1975) 198-231.
2. J. Engelfriet, Top-down tree transducers with regular look-ahead, Math. Systems Theory 10 (1977) 289-303.
3. Z. Fülöp, A complete description for a monoid of deterministic bottom-up tree transformation classes, Theoret. Comput. Sci. 88 (1991) 253-268.
4. Z. Fülöp and S. Vágvölgyi, On compositions of root-to-frontier tree transformations, Acta Cybernet. 7 (1986) 443-480.
5. Z. Fülöp and S. Vágvölgyi, On ranges of compositions of deterministic root-to-frontier tree transformations, Acta Cybernet. 8 (1988) 259-266.
6. Z. Fülöp and S. Vágvölgyi, A finite presentation for a monoid of tree transformation classes, in: F. Gécseg and I. Peák, eds., Proc. 2nd Conf. on Automata, Languages and Programming Systems, Dept. of Mathematics, Univ. of Economics (1988) 115-124.
7. Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with deterministic top-down look-ahead, Inform. Process. Lett. 33 (1989) 3-5.
8. Z. Fülöp and S. Vágvölgyi, Variants of top-down tree transducers with look-ahead, Math. Systems Theory 21 (1989) 125-145.
9. Z. Fülöp and S. Vágvölgyi, A complete rewriting system for a monoid of tree transformation classes, Inform. and Comput. 86 (1990) 195-212.
10. Z. Fülöp and S. Vágvölgyi, A complete classification of deterministic root-to-frontier tree transformation classes, Theoret. Comput. Sci. 81 (1991) 1-15.
11. Z. Fülöp and S. Vágvölgyi, Decidability of the inclusion in monoids generated by tree transformation classes, in: M. Nivat and A. Podelski eds., Tree Automata and Languages (Elsevier, Amsterdam, 1992) 381-408.
12. F. Gécseg and M. Steinby, Tree Automata (Akadémiai Kiadó, Budapest, 1984).
13. G. Slutzki and S. Vágvölgyi, A hierarchy of deterministic top-down tree transformations, in: Proc. FCT'93, Lecture Notes In Computer Science, Vol. 710 (Springer, Berlin, 1993) 440-451; also Math. Systems Theory, to appear.
14. G. Slutzki and S. Vágvölgyi, A hierarchy of deterministic top-down tree transformations, in: Proc. FCT'93, Lecture Notes In Computer Science, Vol. 710 (Springer, Berlin, 1993) 440-451; also Math. Systems Theory, to appear.
15. S. Vágvölgyi and Z. Fülöp, An infinite hierarchy of tree transformations in the class NDR, Acta Cybernet. 8 (1987) 153-168.