Exponential output size of top-down tree transducers
The exponential output size problem for top-down tree transducers asks whether the size of output trees grows exponentially in the size of input trees. In this paper the complexity of this problem is studied. It is shown to be NL-complete for total top-down tree transducers, but DEXPTIME-complete in general.
Unable to display preview. Download preview PDF.
- [FV98]Zoltán Fülöp and Heiko Vogler. Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer, 1998.Google Scholar
- [GS97]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.Google Scholar
- [Pap94]Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- [Tha73]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.Google Scholar