Abstract
We study iterated transductions defined by a class of invertible transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Sutner, K., & Lewi, K. (2012). Iterating invertible binary transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 294–306). https://doi.org/10.1007/978-3-642-31623-4_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
