Groups generated by 3-state automata over a 2-letter alphabet. II
- First Online:
- Cite this article as:
- Bondarenko, I., Grigorchuk, R., Kravchenko, R. et al. J Math Sci (2009) 156: 187. doi:10.1007/s10958-008-9262-5
- 60 Downloads
This is the second in a series of papers presenting results on the classification of groups generated by 3-state automata over a 2-letter alphabet. Among the examples treated here, one can find automata generating the free product of 3 cyclic groups of order 2, a virtually free abelian group of rank 3, a solvable group of derived length 3, some virtually torsion-free weakly branch groups, and other interesting self-similar groups.