Iteration of invertible transductions
From MaRDI portal
Publication:5173290
Recommendations
Cites work
- Automaton semigroups
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- Classifying circular cellular automata
- Complexity classes of equivalence problems revisited
- Computational classification of cellular automata
- Iterating transducers
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- On Relations Defined by Generalized Finite Automata
- On the computational complexity of finite cellular automata
- Sequential Functions
Cited in
(8)- Iterative weighted finite transductions
- Iterating transducers
- Invertible transductions and iteration
- Iterating invertible binary transducers
- scientific article; zbMATH DE number 3860412 (Why is no real title available?)
- Iteration of rational transductions
- Iterating inverse binary transducers
- Invertible transducers, iteration and coordinates
This page was built for publication: Iteration of invertible transductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173290)