License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-17570
URL:

;

The Complexity of Tree Transducer Output Languages

pdf-format:


Abstract

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.

BibTeX - Entry

@InProceedings{inaba_et_al:LIPIcs:2008:1757,
  author =	{Kazuhiro Inaba and Sebastian Maneth},
  title =	{{The Complexity of Tree Transducer Output Languages}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{244--255},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-08-8},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{2},
  editor =	{Ramesh Hariharan and Madhavan Mukund and V Vinay},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1757},
  URN =		{urn:nbn:de:0030-drops-17570},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2008.1757},
  annote =	{Keywords: Complexity, Tree Transducer, OI-hierarchy, Context-Sensitive}
}

Keywords: Complexity, Tree Transducer, OI-hierarchy, Context-Sensitive
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Issue date: 2008
Date of publication: 2008


DROPS-Home | Fulltext Search | Imprint Published by LZI