On a class of poly-context-free groups generated by automata

DOI10.1016/j.jalgebra.2023.03.023OpenAlexW4361264943MaRDI QIDQ2700958

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

Publication date: 27 April 2023

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

dual automatonpoly-context-free groupreducible automatontree automaton grouptree automaton semigroup

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multipass automata and group word problems
• On amenability of automata groups.
• Some topics in the dynamics of group actions on rooted trees.
• Groups, the theory of ends, and context-free languages
• Automata, groups, limit spaces, and tilings.
• On Burnside's problem on periodic groups
• The theory of ends, pushdown automata, and second-order logic
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Combinatorial group theory.
• An automaton group with undecidable order and Engel problems
• Finite automata of polynomial growth do not generate a free group.
• The conjugacy problem in automaton groups is not solvable.
• Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
• Groups with poly-context-free word problem.
• A geometric approach to (semi)-groups defined by automata via dual transducers.
• Freeness of automaton groups vs boundary dynamics
• \(p\)-Basilica groups
• Notes on the Schreier graphs of the Grigorchuk group
• Cellular Automata and Groups
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Finitely generated subgroups of branch groups and subdirect products of just infinite groups
• Eraser morphisms and membership problem in groups and monoids
• Catalan fragile words
• Graph automaton groups
• Boundary dynamics for bireversible and for contracting automaton groups
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE