Groups generated by 3-state automata over a 2-letter alphabet, I

Simple item page
dc.creatorBondarenko, Ievgen
dc.creatorGrigorchuk, Rostislav
dc.creatorKravchenko, Rostyslav
dc.creatorMuntyan, Yevgen
dc.creatorNekrashevych, Volodymyr
dc.creatorSavchuk, Dmytro
dc.creatorSunic, Zoran
dc.date2006-12-07
dc.date.accessioned2026-07-07T07:34:43Z
dc.date.available2026-07-07T07:34:43Z
dc.descriptionAn 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.
dc.description37 pages, 52 figures
dc.identifierhttps://arxiv.org/abs/math/0612178
dc.identifierhttp://arxiv.org/abs/math/0612178
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119866
dc.subjectGroup Theory
dc.subject20E08
dc.titleGroups generated by 3-state automata over a 2-letter alphabet, I
dc.typetext

Files

Collections

arXiv