A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead

Information Processing Letters

Volumn 91, Issue 2, 2004, Pages 57-67

  Fülöp, Zoltán ^a   Kühnemann, Armin ^b   Vogler, Heiko ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Formal languages; Tree automata; Tree transducers

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES; MATHEMATICAL TRANSFORMATIONS; SET THEORY; TRANSDUCERS; TREES (MATHEMATICS);

TREE AUTOMATA; TREE TRANSDUCERS;

DATA PROCESSING;

EID: 2942585610     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.03.014     Document Type: Article

References (20)

1. Baker B.S. Composition of top-down and bottom-up tree transductions. Inform. and Control. 41:1979;186-213.
2. Bloem R., Engelfriet J. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. System Sci. 61:2000;1-50.
3. Courcelle B., Franchi-Zannettacci P. Attribute grammars and recursive program schemes. Theoret. Comput. Sci. 17:1982;163-191. 235-257.
4. F. Drewes, Computation by tree transductions, PhD thesis, University of Bremen, 1996.
5. Engelfriet J. Bottom-up and top-down tree transformations - a comparison. Math. Syst. Theory. 9:(3):1975;198-231.
6. Engelfriet J. Top-down tree transducers with regular look-ahead. Math. Syst. Theory. 10:1977;289-303.
7. Engelfriet J. Some open questions and recent results on tree transducers and tree languages. Book R.V. Formal Language Theory: Perspectives and Open Problems. first ed. 1980;241-286 Academic Press, New York.
8. Engelfriet J. Tree transducers and syntax-directed semantics. Technical Report Memorandum 363, Technische Hogeschool Twente, 1981. Also Proceedings of 7th Colloquium on Trees in Algebra and Programming (CAAP 1992), Lille, France. March 4-6, 1992.
9. Engelfriet J. Tree transducers and syntax-directed semantics. Technical Report Memorandum 363, Technische Hogeschool Twente, 1981. Also Proceedings of 7th Colloquium on Trees in Algebra and Programming (CAAP 1992), Lille, France. March 4-6, 1992.
10. Engelfriet J., Maneth S. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154:1999;34-91.
11. Engelfriet J., Vogler H. Macro tree transducers. J. Comput. System Sci. 31:1985;71-146.
12. Engelfriet J., Vogler H. The translation power of top-down tree-to-graph transducers. J. Comput. System Sci. 49:1994;258-305.
13. Engelfriet J., Vogler H. The equivalence of bottom-up and top-down tree-to-graph transducers. J. Comput. System Sci. 56:1998;332-356.
14. Fülöp Z. On attributed tree transducers. Acta Cybernet. 5:1981;261-279.
15. Fülöp Z., Vágvölgyi S. Variants of top-down tree transducers with look-ahead. Math. Syst. Theory. 21:1989;125-145.
16. Gécseg F., Steinby M. Tree Automata. 1984;Akadémiai Kiadó Budapest.
17. Gécseg F., Steinby M. Tree languages. Rozenberg G., Salomaa A. Handbook of Formal Languages, vol. 3. 1997;1-68 Springer-Verlag, Berlin/New York. Chapter 1.
18. Rounds W.C. Mappings and grammars on trees. Math. Syst. Theory. 4:1970;257-287.
19. 2 sequential machine maps. J. Comput. System Sci. 4:1970;339-367.
20. Thatcher J.W. Tree automata: an informal survey. Aho A.V. Currents in the Theory of Computing. 1973;143-172 Prentice Hall, New York.