Groups defined by automata
From MaRDI portal
Recommendations
Cited in
(22)- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
- Growth Functions and Automatic Groups
- Abelian Invertible Automata
- On torsion-free semigroups generated by invertible reversible Mealy automata
- The word problem for finitary automaton groups
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- An automaton group: a computational case study.
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- Groups, languages and automata
- scientific article; zbMATH DE number 5697432 (Why is no real title available?)
- Automata groups.
- Representation of automata by groups
- Automata, dynamical systems, and groups
- Boundary dynamics for bireversible and for contracting automaton groups
- scientific article; zbMATH DE number 665465 (Why is no real title available?)
- A Characterization of Those Automata That Structurally Generate Finite Groups
- TWO AUTOMATIC SPANNING TREES IN SMALL CANCELLATION GROUP PRESENTATIONS
- Representations of group automata
- Automatic quotients of free groups.
- Automata for subgroups
- Groups defined by automata
- Automatic groups: A guided tour
This page was built for publication: Groups defined by automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244819)