Groups generated by 3-state automata over a 2-letter alphabet, II
Classification of groups generated by 3-state automata over a 2-letter alphabet started in the first paper (see http://www.arxiv.org/abs/math/0612178) is continued.
math.GR↗
arXiv subjects
Ievgen Bondarenko
Publications and source records attributed to Ievgen Bondarenko.
Post-critically finite self-similar groups
We describe in terms of automata theory the automatic actions with post-critically finite limit space. We prove that these actions are precisely the actions by bounded automata and that any self-similar action by bounded automata is contracting.
math.GR↗
Groups generated by 3-state automata over a 2-letter alphabet, I
An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite, abelian, and free groups are classified. In addition, we provide detailed information and complete proofs for several groups from the class, with the intention of showing the main methods and techniques used in the classification.
math.GR↗