|
Algebra and Discrete Mathematics, 2010, Volume 9, Issue 1, Pages 86–102
(Mi adm22)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
RESEARCH ARTICLE
Finite groups as groups of automata with no cycles with exit
Andriy Russyev Department of Mechanics and Mathematics, Kyiv National Taras Shevchenko University, Volodymyrska, 60, Kyiv 01033
Abstract:
Representations of finite groups as automata groups over a binary alphabet are investigated. The subclass of groups of automata with no cycles with exit is studied.
Keywords:
automaton, automaton group, finite group, wreath product.
Received: 22.09.2009 Revised: 18.05.2010
Citation:
Andriy Russyev, “Finite groups as groups of automata with no cycles with exit”, Algebra Discrete Math., 9:1 (2010), 86–102
Linking options:
https://www.mathnet.ru/eng/adm22 https://www.mathnet.ru/eng/adm/v9/i1/p86
|
|