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.

• Type: Conference
• Year: 2008
• Where: FSTTCS
• Authors: Kazuhiro Inaba, Sebastian Maneth
• Keywords: FSTTCS 2008, Macro Tree Transducers, Software Engineering