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ć

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)187-208
Number of pages22
JournalJournal of Mathematical Sciences (United States)
Volume156
Issue number1
DOIs
StatePublished - 2009

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics(all)
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Groups generated by 3-state automata over a 2-letter alphabet. ii'. Together they form a unique fingerprint.

Cite this