Iterating invertible binary transducers

Authors:
Klaus Sutner;Kevin Lewi
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Stanford University, Stanford, CA
Venue:
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Year:
2012

Citing 10
Cited 1

Sequential Functions

Journal of the ACM (JACM)
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata Theory and Its Applications

Automata Theory and Its Applications
Word Processing in Groups

Word Processing in Groups
On Circuits and Numbers

IEEE Transactions on Computers
Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Automatic structures: overview and future directions

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Elements of Automata Theory

Elements of Automata Theory
On relations defined by generalized finite automata

IBM Journal of Research and Development

Invertible transducers, iteration and coordinates

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.