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

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. 2009 Springer Science+Business Media, Inc.

published proceedings

  • Journal of Mathematical Sciences

author list (cited authors)

  • Bondarenko, I., Grigorchuk, R., Kravchenko, R., Muntyan, Y., Nekrashevych, V., Savchuk, D., & uni, Z.

citation count

  • 6

complete list of authors

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

publication date

  • January 2009