Abstract
Two-way transducers are ordinary finite two-way automata that are provided with a one-way write-only tape. They perform a word to word transformation. Unlike one-way transducers, no characterization of these objects as such exists so far except for the deterministic case. We study the other particular case where the input and output alphabets are both unary but when the transducer is not necessarily deterministic. This yields a family which extends properly the rational relations in a very natural manner. We show that deterministic two-way unary transducers are no more powerful than one-way transducers. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Choffrut, C., & Guillon, B. (2014). An algebraic characterization of unary two-way transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8634 LNCS, pp. 196–207). Springer Verlag. https://doi.org/10.1007/978-3-662-44522-8_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
