Groups generated by 3-state automata over a 2-letter alphabet, I
Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko, Yevgen Muntyan, Volodymyr Nekrashevych, Dmytro Savchuk, Zoran Sunic
Abstract
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.
Create a lesson
Related papers
Kleisli convolution representations of power monoids
Haicun Wen, Jian He, Yu-Zhe Liu
The Hurwitz Action in the Affine Symmetric Group
Patrick Wegener
Classification of Group Extensions
Claude Archer
A Determination of B-groups of Order p4
Christopher Herbig
A note on normal generation and the first 2-betti number
Sam P. Fisher, Yash Lodha
Asymptotic enumeration of minimally transitive permutation groups
Binzhou Xia, Shasha Zheng