Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko, Yevgen Muntyan, Volodymyr Nekrashevych, Dmytro Savchuk, Zoran Sunic
Published 2006-12-07Version 1
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.
Comments: 37 pages, 52 figures
Classification of groups generated by 3-state automata over a 2-letter alphabet
A classification of finite $p$-groups with a unique $\mathcal{A}_2$-subgroup
Classification of non-solvable groups whose power graph is a cograph
![QR code for arXiv:math/0612178 [math.GR]](http://oss.arxitics.com/images/favicon.svg)