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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Carton, O. (2012). Two-way transducers with a two-way output tape. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 263–272). https://doi.org/10.1007/978-3-642-31653-1_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
