Linear deterministic multi bottom-up tree transducers

Theoretical Computer Science

Volumn 347, Issue 1-2, 2005, Pages 276-287

  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

Tree automata; Tree transducers

Indexed keywords

LINEAR SYSTEMS; MATHEMATICAL TRANSFORMATIONS; TRANSDUCERS; TREES (MATHEMATICS);

TREE AUTOMATA; TREE TRANSDUCERS; TREE TRANSFORMATIONS;

COMPUTER SCIENCE;

EID: 27844577295     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.025     Document Type: Article

References (16)

1. B.S. Baker Composition of top-down and bottom-up tree transductions Inform. and Control 41 2 1979 186 213
2. J. Engelfriet Bottom-up and top-down tree transformations - a comparison Math. Systems Theory 9 3 1975 198 231
3. J. Engelfriet Top-down tree transducers with regular look-ahead Math. Systems Theory 10 1977 289 303
4. J. Engelfriet Context-free graph grammars G. Rozenberg A. Salomaa Handbook of Formal Languages - Volume 3: Beyond Words 1997 Springer Berlin 125 213 (Chapter 3)
5. J. Engelfriet, and S. Maneth Macro tree transducers, attribute grammars, and MSO definable tree translations Inform. and Comput. 154 1999 34 91
6. J. Engelfriet, G. Rozenberg, and G. Slutzki Tree transducers, L systems, and two-way machines J. Comput. System Sci. 20 2 1980 150 202
7. J. Engelfriet, and S. Skyum Copying theorems Inform. Process. Lett. 4 1976 157 161
8. J. Engelfriet, and H. Vogler The equivalence of bottom-up and top-down tree-to-graph transducers J. Comput. System Sci. 56 1998 332 356
9. Z. Fülöp A complete description for a monoid of deterministic bottom-up tree transformation classes Theoret. Comput. Sci. 88 1991 253 268
10. Z. Fülöp, A. Kühnemann, and H. Vogler A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead Inform. Process. Lett. 91 2004 57 67
11. F. Gécseg, and M. Steinby Tree Automata 1984 Akadémiai Kiadó Budapest
12. F. Gécseg, and M. Steinby Tree languages G. Rozenberg A. Salomaa Handbook of Formal Languages, Vol. 3 1997 Springer Berlin 1 68 (Chapter 1)
13. P. Gyenizse, and S. Vágvölgyi Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations Theoret. Comput. Sci. 156 1996 71 97
14. A. Kühnemann, Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata, Ph.D. Thesis, Dresden University of Technology, Dresden, 1997, Shaker, Aachen.
15. W.C. Rounds Mappings and grammars on trees Math. Systems Theory 4 3 1970 257 287
16. 2 sequential machine maps J. Comput. System Sci. 4 4 1970 339 367