Some solvable automaton groups.
zbMATH Open1106.20021arXivmath/0603032MaRDI QIDQ5488870FDOQ5488870
Authors: Laurent Bartholdi, Zoran Šuniḱ 
Publication date: 25 September 2006
Full work available at URL: https://arxiv.org/abs/math/0603032
Recommendations
- A sampling of remarkable groups. Thompson's, self-similar, lamplighter, and Baumslag-Solitar
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- The lamplighter group of rank two generated by a bireversible automaton
- Groups generated by 3-state automata over a 2-letter alphabet. II.
- The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
automaton groupslamplighter groupsSchreier graphsascending HNN extensionsdual automatasolvable Baumslag-Solitar groups
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Algebraic theory of languages and automata (68Q70) Solvable groups, supersolvable groups (20F16)
Cited In (27)
- On exponentiation, p-automata and HNN extensions of free abelian groups
- The conjugacy problem in automaton groups is not solvable.
- Title not available (Why is that?)
- On the automaton complexity of wreath powers of non-Abelian finite simple groups.
- Lamplighter groups and automata
- Endomorphisms of regular rooted trees induced by the action of polynomials on the ring \(\mathbb{Z}_d\) of \(d\)-adic integers
- Self-similar groups of type \(FP_n\)
- Automatic semigroups vs automaton semigroups
- SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
- On the asynchronous rational group
- Automata, groups, limit spaces, and tilings.
- Affine automorphisms of rooted trees
- Description of the class of strictly differentiable finite-state isometries of the ring \(Z_2\)
- The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
- Automatically presented groups.
- Rational embeddings of hyperbolic groups
- Groups generated by 3-state automata over a 2-letter alphabet. II.
- On reversible automata generating lamplighter groups
- Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\).
- The lamplighter group of rank two generated by a bireversible automaton
- On state-closed representations of restricted wreath product of groups \(G_{p,d}=C_{p}wrC^{d}\)
- Scale-invariant groups.
- Extensions of automorphisms of self-similar groups
- Lamplighter groups, bireversible automata, and rational series over finite rings
- Finite-state self-similar actions of nilpotent groups.
- A group of automorphisms of the rooted dyadic tree and associated Gelfand pairs
- Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
This page was built for publication: Some solvable automaton groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488870)
