The Complexity of Tree Transducer Output Languages
From MaRDI portal
Publication:3165963
DOI10.4230/LIPIcs.FSTTCS.2008.1757zbMath1248.68205OpenAlexW2162756824MaRDI QIDQ3165963
Kazuhiro Inaba, Sebastian Maneth
Publication date: 19 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_3b11.html
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Polynomial-time inverse computation for accumulative functions with multiple data traversals ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
This page was built for publication: The Complexity of Tree Transducer Output Languages
