Geodesic
Free Products of Finite Groups and Groups of Finitely Automatic Permutations
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Dynamical systems, automata, and infinite groups, Tome 231 (2000), pp. 323-331

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

A constructive proof is given to the isomorphic embeddability of a free product of a finite number of finite groups into a group of finitely automatic permutations over an alphabet in which the number of symbols is equal to the maximal order of the free factors. 
@article{TM_2000_231_a11,
     author = {A. S. Oliinyk},
     title = {Free {Products} of {Finite} {Groups} and {Groups} of {Finitely} {Automatic} {Permutations}},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {323--331},
     publisher = {mathdoc},
     volume = {231},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TM_2000_231_a11/}
}
TY  - JOUR
AU  - A. S. Oliinyk
TI  - Free Products of Finite Groups and Groups of Finitely Automatic Permutations
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2000
SP  - 323
EP  - 331
VL  - 231
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TM_2000_231_a11/
LA  - ru
ID  - TM_2000_231_a11
ER  - 
%0 Journal Article
%A A. S. Oliinyk
%T Free Products of Finite Groups and Groups of Finitely Automatic Permutations
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2000
%P 323-331
%V 231
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TM_2000_231_a11/
%G ru
%F TM_2000_231_a11
A. S. Oliinyk. Free Products of Finite Groups and Groups of Finitely Automatic Permutations. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Dynamical systems, automata, and infinite groups, Tome 231 (2000), pp. 323-331. http://geodesic.mathdoc.fr/item/TM_2000_231_a11/