Sciweavers

FSTTCS
2008
Springer

The Complexity of Tree Transducer Output Languages

13 years 4 months ago
The Complexity of Tree Transducer Output Languages
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class is NP-complete.
Kazuhiro Inaba, Sebastian Maneth
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Where FSTTCS
Authors Kazuhiro Inaba, Sebastian Maneth
Comments (0)