Pages that link to "Item:Q2957911"
From MaRDI portal
The following pages link to The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable (Q2957911):
Displaying 13 items.
- Automaton semigroups: the two-state case. (Q290910) (← links)
- Automaton semigroups: new constructions results and examples of non-automaton semigroups (Q528468) (← links)
- Orbit automata as a new tool to attack the order problem in automaton groups (Q891470) (← links)
- On level-transitivity and exponential growth (Q1702514) (← links)
- Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness (Q2190041) (← links)
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet (Q2396829) (← links)
- Two-letter group codes that preserve aperiodicity of inverse finite automata. (Q2480773) (← links)
- Ergodic decomposition of group actions on rooted trees (Q2631143) (← links)
- On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (Q2799184) (← links)
- Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427) (← links)
- Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups (Q4608606) (← links)
- (Q5092326) (← links)
- Algorithmic Decidability of Engel’s Property for Automaton Groups (Q5740175) (← links)
