scientific article; zbMATH DE number 3389248

zbMATH Open0246.20024MaRDI QIDQ5658240FDOQ5658240

Authors: Stanislav V. Aleshin 

Publication date: 1972

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Local properties of groups (20E25)

Cited In (33)

• Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups.
• Endomorphisms of regular rooted trees induced by the action of polynomials on the ring \(\mathbb{Z}_d\) of \(d\)-adic integers
• Automata algebras
• Automatic semigroups vs automaton semigroups
• The Burnside problem on periodic groups and related questions.
• Subgroups of certain groups of Aleshin type
• Automata, groups, limit spaces, and tilings.
• Automaton semigroups: the two-state case.
• An automata group of intermediate growth and exponential activity
• Noise sensitivity of random walks on groups
• An automaton group with undecidable order and Engel problems
• Self-similar groups, automatic sequences, and unitriangular representations
• Boundary dynamics for bireversible and for contracting automaton groups
• Automata generating free products of groups of order 2.
• The group of asynchronous automata and rational homeomorphisms of the Cantor set
• Orbit automata as a new tool to attack the order problem in automaton groups
• Palindromic subshifts and simple periodic groups of intermediate growth
• Automata in groups and dynamics and induced systems of PDE in tropical geometry
• Automaton (semi)groups: Wang tilings and Schreier tries
• Systems of generators of automaton permutations groups
• Growth behaviors in the range \(e^{r^\alpha}\).
• Branch groups
• Growth of periodic Grigorchuk groups
• Amenability and non-uniform growth of some directed automorphism groups of a rooted tree
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• On torsion-free semigroups generated by invertible reversible Mealy automata
• On bireversible Mealy automata and the Burnside problem
• Groups with Abelian subgroups of finite ranks
• On periodic residually finite \(F^*_ p\)-groups
• Iterated identities and iterational depth of groups
• Ordering the space of finitely generated groups
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• Some undecidability results for asynchronous transducers and the Brin-Thompson group \(2V\)

This page was built for publication:

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