Boundary dynamics for bireversible and for contracting automaton groups
From MaRDI portal
Publication:5221286
DOI10.1142/S021819672050006XzbMath1486.20031OpenAlexW2979353153WikidataQ114614805 ScholiaQ114614805MaRDI QIDQ5221286
Emanuele Rodaro, Daniele D'Angeli, Thibault Godin, Matthieu Picantin, Ines Klimann
Publication date: 25 March 2020
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021819672050006x
Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Groups acting on trees (20E08)
Related Items
On a class of poly-context-free groups generated by automata ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Schreier graphs of spinal groups ⋮ Infinite automaton semigroups and groups have infinite orbits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine automorphisms of rooted trees
- On a family of Schreier graphs of intermediate growth associated with a self-similar group
- Some topics in the dynamics of group actions on rooted trees.
- Orbit automata as a new tool to attack the order problem in automaton groups
- On a series of finite automata defining free transformation groups.
- Schreier graphs of the Basilica group.
- On the Burnside problem for periodic groups
- On Burnside's problem on periodic groups
- A new hierarchy for automaton semigroups
- Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
- Groups defined by automata
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- On the complexity of the word problem for automaton semigroups and automaton groups
- Automata and square complexes.
- Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
- The spectra of lamplighter groups and Cayley machines.
- Freeness of automaton groups vs boundary dynamics
- On a free group of transformations defined by an automaton.
- On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
- The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton
- Notes on the Schreier graphs of the Grigorchuk group
- Implementing Computations in Automaton (Semi)groups
- Groups and semigroups defined by colorings of synchronizing automata
- AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
- A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
- Automaton (Semi)groups: Wang Tilings and Schreier Tries
- ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
- Self-similar groups acting essentially freely on the boundary of the binary rooted tree
