|
Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2000, Volume 231, Pages 323–331
(Mi tm521)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Free Products of Finite Groups and Groups of Finitely Automatic Permutations
A. S. Oliinyk National Taras Shevchenko University of Kyiv
Abstract:
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.
Received in February 2000
Citation:
A. S. Oliinyk, “Free Products of Finite Groups and Groups of Finitely Automatic Permutations”, Dynamical systems, automata, and infinite groups, Collected papers, Trudy Mat. Inst. Steklova, 231, Nauka, MAIK «Nauka/Inteperiodika», M., 2000, 323–331; Proc. Steklov Inst. Math., 231 (2000), 308–315
Linking options:
https://www.mathnet.ru/eng/tm521 https://www.mathnet.ru/eng/tm/v231/p323
|
Statistics & downloads: |
Abstract page: | 369 | Full-text PDF : | 134 | References: | 48 | First page: | 1 |
|