Sciweavers

81
Voted
FSTTCS
2008
Springer
15 years 7 days 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 ...
Kazuhiro Inaba, Sebastian Maneth