Freeness of automaton groups vs boundary dynamics
From MaRDI portal
Publication:2629888
DOI10.1016/j.jalgebra.2016.05.015zbMath1454.20069arXiv1410.6097MaRDI QIDQ2629888
Daniele D'Angeli, Emanuele Rodaro
Publication date: 8 July 2016
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.6097
68Q45: Formal languages and automata
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
68Q70: Algebraic theory of languages and automata
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20E08: Groups acting on trees
Related Items
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group, Unnamed Item, Eraser morphisms and membership problem in groups and monoids, Fragile words and Cayley type transducers, Boundary dynamics for bireversible and for contracting automaton groups, Graph automaton groups, An automaton group with undecidable order and Engel problems, On the existence of free subsemigroups in reversible automata semigroups, Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness, Infinite automaton semigroups and groups have infinite orbits, On the complexity of the word problem for automaton semigroups and automaton groups, On groups generated by bi-reversible automata: the two-state case over a changing alphabet, On a class of poly-context-free groups generated by automata, A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
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
- Some topics in the dynamics of group actions on rooted trees.
- The concept of duality for automata over a changing alphabet and generation of a free group by such automata
- On a series of finite automata defining free transformation groups.
- Schreier graphs of the Basilica group.
- Stallings foldings and subgroups of free groups
- Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- Fixed points of endomorphisms of virtually free groups.
- Automata and square complexes.
- On a free group of transformations defined by an automaton.
- The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton
- Implementing Computations in Automaton (Semi)groups
- Groups and semigroups defined by colorings of synchronizing automata
- Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$
- AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
- FINITE SELF-SIMILAR p-GROUPS WITH ABELIAN FIRST LEVEL STABILIZERS
- Totally nonfree actions and infinite symmetric group
- Self-similar groups acting essentially freely on the boundary of the binary rooted tree
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
