One-way definability of sweeping transducers - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

One-way definability of sweeping transducers


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.
Fichier principal
Vignette du fichier
main.pdf (630.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01219509 , version 1 (28-10-2015)
hal-01219509 , version 2 (02-12-2015)


  • HAL Id : hal-01219509 , version 2


Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. One-way definability of sweeping transducers. 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. ⟨hal-01219509v2⟩


198 View
86 Download


Gmail Facebook X LinkedIn More