Two-way transducers with a two-way output tape

Authors:
Olivier Carton
Affiliations:
LIAFA, Université Paris Diderot & CNRS, France
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 4
Cited 1

MSO definable string transductions and two-way finite-state transducers

ACM Transactions on Computational Logic (TOCL)
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development
On relations defined by generalized finite automata

IBM Journal of Research and Development
Nondeterministic streaming string transducers

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II

From Two-Way to One-Way Finite State Transducers

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider two-way transducers with a two-way output tape. To each cell of the input tape corresponds a cell of the output tape where the transducer can write a finite word. At each transition, the transducer reads one cell of the input tape and either leave unchanged the corresponding cell of the output tape or write a new word into it, overwriting the previous content. We show that each relation realized by such a two-way transducer is rational. It can be realized by a one-way transducer. We also show that any rational function can be realized by a deterministic two-way transducer.