This article is cited in 57 papers

Finite automata and Burnside's problem for periodic groups

S. V. Aleshin

M. V. Lomonosov Moscow State University

Abstract: 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.

UDC: 519.4

Received: 12.02.1971

 English version: Mathematical Notes, 1972, 11:3, 199–203

Bibliographic databases:

• 
•