Generic properties in some classes of automaton groups
From MaRDI portal
Publication:2278570
DOI10.1007/978-3-030-20981-0_7zbMath1425.68277arXiv1903.11315OpenAlexW2962797503MaRDI QIDQ2278570
Publication date: 5 December 2019
Full work available at URL: https://arxiv.org/abs/1903.11315
Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- Free subgroups in groups acting on rooted trees
- The word and order problems for self-similar and automata groups
- Amenability via random walks.
- On Burnside's problem on periodic groups
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- A new hierarchy for automaton semigroups
- An automaton group with undecidable order and Engel problems
- On exponential growth and uniformly exponential growth for groups.
- Permutive one-way cellular automata and the finiteness problem for automaton groups
- On the existence of free subsemigroups in reversible automata semigroups
- On a free group of transformations defined by an automaton.
- On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
- Implementing Computations in Automaton (Semi)groups
- A Remark on Stirling's Formula
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- An analogue to Dixon's theorem for automaton groups
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
- The probability of generating the symmetric group
This page was built for publication: Generic properties in some classes of automaton groups
