Finite automata and Burnside's problem for periodic groups

DOI10.1007/BF01098526zbMATH Open0253.20049MaRDI QIDQ2557787FDOQ2557787

Authors: Stanislav V. Aleshin 

Publication date: 1972

Published in: Mathematical Notes (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Structure and classification of infinite or finite groups (20E99)

Cites Work

• Title not available (Why is that?)

Cited In (16)

• The construction of infinite finitely generated periodic groups using wreath products
• Behaviors of entropy on finitely generated groups
• ON VERBAL SUBGROUPS IN RESIDUALLY FINITE GROUPS
• On a 2-generated infinite 3-group: The presentation problem
• On Reductants of Two Groups
• The groups of \(ZC\)-automaton transformations.
• On Residually Finite Groups with Engel-like Conditions
• Self-similar Lie algebras
• A just-nonsolvable torsion-free group defined on the binary tree
• On the automorphism group of the one-rooted binary tree
• On growth of random groups of intermediate growth.
• Folner sets of alternate directed groups
• On periodic groups having almost regular 2-elements
• Commutators in residually finite groups.
• Multilinear commutators in residually finite groups.
• (Self-)similar groups and the Farrell-Jones conjectures.

This page was built for publication: Finite automata and Burnside's problem for periodic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557787)