Exponential output size of top-down tree transducers

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

Volumn 1684, Issue , 1999, Pages 234-245

  Drewes, Frank ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; TRANSDUCERS;

TOP-DOWN TREE TRANSDUCERS; TOP-DOWN TREES;

FORESTRY;

EID: 84956863278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_19     Document Type: Conference Paper

References (9)

1. Alfred V. Aho and Jeffrey D. Ullman. Translations on a context free grammar. Information and Control, 19:439-475, 1971.
2. Joost Engelfriet. Three hierarchies of transducers. Mathematical Systems Theory, 15:95-125, 1982.
3. Zoltán Fülöp and Heiko Vogler. Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer, 1998.
4. Ferenc Gécseg and Magnus Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 1, pages 1-68. Springer, 1997.
5. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
6. William C. Rounds. Mappings and grammars on trees. Mathematical Systems Theory, 4:257-287, 1970.
7. Helmut Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2):57-60, 1994.
8. James W. Thatcher. Generalized2 sequential machine maps. Journal of Computer and System Sciences, 4:339-367, 1970.
9. James W. Thatcher. Tree automata: an informal survey. In A.V. Aho, editor, Currents in the Theory of Computing, pages 143-172. Prentice Hall, 1973.