Andriy Russyev, “Finite groups as groups of automata with no cycles with exit”, Algebra Discrete Math., 2010, том 9, выпуск 1,страницы 86

Эта публикация цитируется в 4 статьях

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

Аннотация: 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.

Ключевые слова: automaton, automaton group, finite group, wreath product.

MSC: 20E08

Поступила в редакцию: 22.09.2009
Исправленный вариант: 18.05.2010

Язык публикации: английский