ITERATION OF INVERTIBLE TRANSDUCTIONS

DOI10.1142/S0129054114400127zbMath1320.68116OpenAlexW2151869338MaRDI QIDQ5173290

Klaus Sutner

Publication date: 9 February 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114400127

zbMATH Keywords

iterationrationalityinvertible transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Complexity classes of equivalence problems revisited
• Classifying circular cellular automata
• Automaton semigroups
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Iterating transducers
• On the computational complexity of finite cellular automata
• Computational classification of cellular automata
• Sequential Functions
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• On Relations Defined by Generalized Finite Automata