TY - JOUR

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

AU - Bondarenko, I.

AU - Grigorchuk, R.

AU - Kravchenko, R.

AU - Muntyan, Y.

AU - Nekrashevych, V.

AU - Savchuk, D.

AU - Šunić, Z.

N1 - Funding Information:
This work was partially supported by NSF grants DMS-0456185, DMS-0600975,
Publisher Copyright:
© 2009 Springer Science+Business Media, Inc.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84874629153&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874629153&partnerID=8YFLogxK

U2 - 10.1007/s10958-008-9262-5

DO - 10.1007/s10958-008-9262-5

M3 - Article

AN - SCOPUS:84874629153

VL - 156

SP - 187

EP - 208

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 1

ER -