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

UDC: 512.54

Received in February 2000

 English version: Proceedings of the Steklov Institute of Mathematics, 2000, 231, 308–315

Bibliographic databases:

• 
•