License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2015.178
URN: urn:nbn:de:0030-drops-56297
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5629/
Go to the corresponding LIPIcs Volume Portal


Baschenis, Félix ; Gauwin, Olivier ; Muscholl, Anca ; Puppis, Gabriele

One-way Definability of Sweeping Transducer

pdf-format:
14.pdf (0.6 MB)


Abstract

Two-way finite-state transducers on words are strictly more expressive than one-way transducers. It has been shown recently how to decide if a two-way functional transducer has an equivalent one-way transducer, and the complexity of the algorithm is non-elementary. We propose an alternative and simpler characterization for sweeping functional transducers, namely, for transducers that can only reverse their head direction at the extremities of the input. Our algorithm works in 2EXPSPACE and, in the positive case, produces an equivalent one-way transducer of doubly exponential size. We also show that the bound on the size of the transducer is tight, and that the one-way definability problem is undecidable for (sweeping) non-functional transducers.

BibTeX - Entry

@InProceedings{baschenis_et_al:LIPIcs:2015:5629,
  author =	{F{\'e}lix Baschenis and Olivier Gauwin and Anca Muscholl and Gabriele Puppis},
  title =	{{One-way Definability of Sweeping Transducer}},
  booktitle =	{35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
  pages =	{178--191},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-97-2},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{45},
  editor =	{Prahladh Harsha and G. Ramalingam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5629},
  URN =		{urn:nbn:de:0030-drops-56297},
  doi =		{10.4230/LIPIcs.FSTTCS.2015.178},
  annote =	{Keywords: Regular word transductions, sweeping transducers, one-way definability}
}

Keywords: Regular word transductions, sweeping transducers, one-way definability
Seminar: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Issue Date: 2015
Date of publication: 11.12.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI