Groups generated by 3-state automata over a 2-letter alphabet, I
Group Theory
2007-05-23 v1
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.
Cite
@article{arxiv.math/0612178,
title = {Groups generated by 3-state automata over a 2-letter alphabet, I},
author = {Ievgen Bondarenko and Rostislav Grigorchuk and Rostyslav Kravchenko and Yevgen Muntyan and Volodymyr Nekrashevych and Dmytro Savchuk and Zoran Sunic},
journal= {arXiv preprint arXiv:math/0612178},
year = {2007}
}
Comments
37 pages, 52 figures