Geodesic
Finite groups as groups of automata with no cycles with exit
Algebra and discrete mathematics, Tome 9 (2010) no. 1, pp. 86-102.

Voir la notice de l'article provenant de la source Math-Net.Ru

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, finite group, wreath product.
Mots-clés : automaton group 
@article{ADM_2010_9_1_a7,
     author = {Andriy Russyev},
     title = {Finite groups as groups of automata with no cycles with exit},
     journal = {Algebra and discrete mathematics},
     pages = {86--102},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {2010},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/ADM_2010_9_1_a7/}
}
TY  - JOUR
AU  - Andriy Russyev
TI  - Finite groups as groups of automata with no cycles with exit
JO  - Algebra and discrete mathematics
PY  - 2010
SP  - 86
EP  - 102
VL  - 9
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/ADM_2010_9_1_a7/
LA  - en
ID  - ADM_2010_9_1_a7
ER  - 
%0 Journal Article
%A Andriy Russyev
%T Finite groups as groups of automata with no cycles with exit
%J Algebra and discrete mathematics
%D 2010
%P 86-102
%V 9
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/ADM_2010_9_1_a7/
%G en
%F ADM_2010_9_1_a7
Andriy Russyev. Finite groups as groups of automata with no cycles with exit. Algebra and discrete mathematics, Tome 9 (2010) no. 1, pp. 86-102. https://geodesic-test.mathdoc.fr/item/ADM_2010_9_1_a7/