Journal of Mathematical Sciences

, Volume 156, Issue 1, pp 187–208

Groups generated by 3-state automata over a 2-letter alphabet. II

  • I. Bondarenko
  • R. Grigorchuk
  • R. Kravchenko
  • Y. Muntyan
  • V. Nekrashevych
  • D. Savchuk
  • Z. Šunić
Article

DOI: 10.1007/s10958-008-9262-5

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

Abstract

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.

Copyright information

© Springer Science+Business Media, Inc. 2009

Authors and Affiliations

  • I. Bondarenko
    • 1
  • R. Grigorchuk
    • 1
  • R. Kravchenko
    • 1
  • Y. Muntyan
    • 1
  • V. Nekrashevych
    • 1
  • D. Savchuk
    • 1
  • Z. Šunić
    • 1
  1. 1.Department of MathematicsTexas A&M UniversityCollege StationUSA

Personalised recommendations