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.

[1]  Zoltán Fülöp,et al.  Syntax-Directed Semantics , 1998, Monographs in Theoretical Computer Science An EATCS Series.

[2]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[3]  Helmut Seidl,et al.  Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[4]  Alfred V. Aho,et al.  Translations on a Context-Free Grammar , 1971, Inf. Control..

[5]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[6]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .