The complexity of compositions of deterministic tree transducers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2556 LNCS, Issue , 2002, Pages 265-276

  Maneth, Sebastian ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Complexity; Deterministic Macro tree transducers

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; CONTEXT SENSITIVE LANGUAGES; MACROS; TRANSDUCERS; COMPUTATIONAL LINGUISTICS; SOFTWARE ENGINEERING;

ARBITRARY COMPOSITIONS; ATTRIBUTE GRAMMARS; COMPLEXITY; COMPLEXITY OF COMPOSITIONS; CONTEXT SENSITIVE; CONTROL HIERARCHY; INTERMEDIATE RESULTS; TREE TRANSDUCERS;

FORESTRY;

EID: 0041943372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_24     Document Type: Conference Paper

References (24)

1. P.R.J. Asveld. Time and space complexity of inside-out macro languages. Internat. J. Comput. Math., 10: 3-14, 1981.
2. B. S. Baker. Generalized syntax directed translation, tree transducers, and linear space. SIAM J. Comput., 7(3): 376-391, 1978.
3. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. TCS, 17: 163-191 and 235-257, 1982.
4. W. Damm. The IO- and OI-hierarchies. TCS, 20: 95-207, 1982.
5. F. Drewes and J. Engelfriet. Decidability of finiteness of ranges of tree trans-ductions. Inform. and Comput., 145: 1-50, 1998.
6. P. Deransart, M. Jourdan, and B. Lorho. Attribute Grammars, Definitions and Bibliography. Number 323 in LNCS. Springer-Verlag, 1988.
7. J. Engelfriet and S. Maneth. Work in progress.
8. J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput., 154: 34-91, 1999.
9. J. Engelfriet and S. Maneth. Output string languages of compositions of deterministic macro tree transducers. JCSS, 64(2): 350-395, 2002.
10. J. Engelfriet. Bottom-up and top-down tree transformations - a comparison. Math. Systems Theory, 9(3): 198-231, 1975.
11. J. Engelfriet. The complexity of languages generated by attribute grammars. SIAM J. Comput., 15(1): 70-86, 1986.
12. J. Engelfriet and H. Vogler. Macro tree transducers. JCSS, 31: 71-146, 1985.
13. M.J. Fischer. Grammars with macro-like productions. PhD thesis, Harvard University, Massachusetts, 1968.
14. Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5: 261-279, 1981.
15. 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.
16. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
17. D.E. Knuth. Semantics of context-free languages. Math. Systems Theory, 2: 127-145, 1968.
18. (Corrections in Math. Systems Theory, 5: 95-96, 1971).
19. 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.
20. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In Proc. PODS'2000, pages 11-22. ACM Press, 2000.
21. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
22. V. Vianu. A Web Odyssey: From Codd to XML. In Proc. PODS'2001, pages 1-15. ACM Press, 2001.
23. H. Vogler. Functional description of the contextual analysis in block-structured programming languages: a case study of tree transducers. Science of Computer Programming, 16(3): 251-275, 1991.
24. P. Wadler. Deforestation: Transforming programs to eliminate trees. TCS, 73: 231-248, 1990.