Geodesic
Finite automata and Burnside's problem for periodic groups
Matematičeskie zametki, Tome 11 (1972) no. 3, pp. 319-328 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

New examples of infinite periodic finitely-generated groups are constructed. The elements of the groups are mappings of a set of words in an alphabet $X$ into itself induced by finite Mealy automata. Estimates are given of the number of states and diagrams of the automata realizing the generating elements of the groups. There are three items in the literature cited. 
@article{MZM_1972_11_3_a11,
     author = {S. V. Aleshin},
     title = {Finite automata and {Burnside's} problem for periodic groups},
     journal = {Matemati\v{c}eskie zametki},
     pages = {319--328},
     year = {1972},
     volume = {11},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1972_11_3_a11/}
}
TY  - JOUR
AU  - S. V. Aleshin
TI  - Finite automata and Burnside's problem for periodic groups
JO  - Matematičeskie zametki
PY  - 1972
SP  - 319
EP  - 328
VL  - 11
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MZM_1972_11_3_a11/
LA  - ru
ID  - MZM_1972_11_3_a11
ER  - 
%0 Journal Article
%A S. V. Aleshin
%T Finite automata and Burnside's problem for periodic groups
%J Matematičeskie zametki
%D 1972
%P 319-328
%V 11
%N 3
%U http://geodesic.mathdoc.fr/item/MZM_1972_11_3_a11/
%G ru
%F MZM_1972_11_3_a11
S. V. Aleshin. Finite automata and Burnside's problem for periodic groups. Matematičeskie zametki, Tome 11 (1972) no. 3, pp. 319-328. http://geodesic.mathdoc.fr/item/MZM_1972_11_3_a11/