Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
104
click to vote
FSTTCS
2008
Springer
109
views
Software Engineering
»
more
FSTTCS 2008
»
The Complexity of Tree Transducer Output Languages
15 years 4 months ago
Download
www.cse.unsw.edu.au
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
claim paper
Read More »