Skip to main content
Log in

Finite automata and Burnside's problem for periodic groups

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Literature cited

  1. A. G. Kurosh, Group Theory tin Russian], Moscow (1967).

  2. J. Horejš, “Transformations defining finite automata,” Problemy Kibernetiki, No. 9, 23–26 (1963).

    Google Scholar 

  3. E. S. Golod, “Nil-algebras and finitely-approximatable groups,” Izv. Akad. Nauk SSSR, Ser. Matem.,28, No. 2, 273–276 (1964).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Matematicheskie Zametki, Vol. 11, No. 3, pp. 319–328, March, 1972.

The author wishes to express his deep gratitude to V. B. Kudryavtsev for supervising the paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aleshin, S.V. Finite automata and Burnside's problem for periodic groups. Mathematical Notes of the Academy of Sciences of the USSR 11, 199–203 (1972). https://doi.org/10.1007/BF01098526

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01098526

Keywords

Navigation