Pages that link to "Item:Q1768261"
From MaRDI portal
The following pages link to Finite automata of polynomial growth do not generate a free group. (Q1768261):
Displaying 21 items.
- The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set. (Q303986) (← links)
- On a family of Schreier graphs of intermediate growth associated with a self-similar group (Q444396) (← links)
- Growth of Schreier graphs of automaton groups. (Q453409) (← links)
- On amenability of automata groups. (Q605907) (← links)
- The action of finite-state tree automorphisms on Bernoulli measures (Q609744) (← links)
- The groups of \(ZC\)-automaton transformations. (Q610303) (← links)
- The conjugacy problem in automaton groups is not solvable. (Q1936130) (← links)
- (Self-)similar groups and the Farrell-Jones conjectures. (Q1943727) (← links)
- Large scale properties for bounded automata groups. (Q2347081) (← links)
- Behaviors of entropy on finitely generated groups (Q2434913) (← links)
- Extensions of amenable groups by recurrent groupoids (Q2520612) (← links)
- On a free group of transformations defined by an automaton. (Q2642671) (← links)
- The true prosoluble completion of a group: examples and open problems. (Q2642673) (← links)
- On a class of poly-context-free groups generated by automata (Q2700958) (← links)
- Growth of action graphs of finite automata (Q2877169) (← links)
- Automaton representation of a free group (Q3225906) (← links)
- TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA (Q3379491) (← links)
- Endomorphisms of regular rooted trees induced by the action of polynomials on the ring ℤd of d-adic integers (Q5132289) (← links)
- A commutator lemma for confined subgroups and applications to groups acting on rooted trees (Q6047150) (← links)
- Amenability of bounded automata groups on infinite alphabets (Q6570072) (← links)
- Iterated monodromy groups of exponential maps (Q6594551) (← links)
