Graph automaton groups

zbMath1495.20038arXiv2007.12871MaRDI QIDQ5154177

Daniele D'Angeli, Alfredo Donno, Emanuele Rodaro, Matteo Cavaleri

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2007.12871

zbMATH Keywords

growthSchreier graphfractal groupgraph automaton group

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items (2)

Gelfand pairs associated with the action of graph automaton groups ⋮ On a class of poly-context-free groups generated by automata

Cites Work

• On a family of Schreier graphs of intermediate growth associated with a self-similar group
• Counting dimer coverings on self-similar Schreier graphs
• Schreier graphs of an extended version of the binary adding machine.
• A survey and classification of Sierpiński-type graphs
• On amenability of automata groups.
• Some topics in the dynamics of group actions on rooted trees.
• Automata, groups, limit spaces, and tilings.
• Schreier graphs of the Basilica group.
• On Burnside's problem on periodic groups
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Følner functions and the generic word problem for finitely generated amenable groups
• An automaton group with undecidable order and Engel problems
• Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
• Infinite automaton semigroups and groups have infinite orbits
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Freeness of automaton groups vs boundary dynamics
• An introduction to right-angled Artin groups.
• From Self-Similar Groups to Self-Similar Sets and Spectra
• Computability of Følner sets
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Partition Functions of the Ising Model on Some Self-similar Schreier Graphs
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph automaton groups