Classification of groups generated by 3-state automata over a 2-letter alphabet
arXiv:0803.3555
Abstract
This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.
151 pages, 251 figures. Takes a looooong time to compile. Please, be patient
References in corpus (7)
- Amenability via random walks
- On the Spectrum of Hecke Type Operators related to some Fractal Groups
- On a conjecture of Atiyah
- Thurston equivalence of topological polynomials
- Iterated Monodromy Groups of Quadratic Polynomials, I
- The smallest Mealy automaton of intermediate growth
- Free subgroups in groups acting on rooted trees