This article is cited 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.

MSC: 20E08

Received: 22.09.2009
Revised: 18.05.2010

Language: English

Bibliographic databases:

• 
•