@inproceedings{inaba_et_al:LIPIcs:2008:1757,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Complexity, Tree Transducer, OI-hierarchy, Context-Sensitive},
Author = {Inaba, Kazuhiro and Maneth, Sebastian},
BookTitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
Editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V},
File = {The Complexity of Tree Transducer Output Languages - Inaba, Maneth (0) (0) - a - a - m.pdf},
ISBN = {978-3-939897-08-8},
ISSN = {1868-8969},
Keywords = {higher-order recursive schemes},
Pages = {244--255},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{The Complexity of Tree Transducer Output Languages}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1757},
Volume = {2},
Year = {2008},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2008/1757},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2008.1757},
date-added = {2013-12-10 15:34:47 +0000},
date-modified = {2013-12-10 15:35:03 +0000},
urn = {urn:nbn:de:0030-drops-17570},
doi = {10.4230/LIPIcs.FSTTCS.2008.1757}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A