Finite automata and Burnside's problem for periodic groups

DOI10.1007/BF01098526MaRDI QIDQ2557787zbMATH OpenFDO

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)

Cited in

(16)

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

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)