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

DOI10.1016/J.JALGEBRA.2023.03.023MaRDI QIDQ6399504arXivFDO

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

Publication date 18 May 2022

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JALGEBRA.2023.03.023

Mathematics Subject Classification ID

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

arXiv classification

math.COmath.GR

Abstract: This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is isomorphic to the partially commutative monoid associated with the complement of the line graph of the defining tree. After that, we generalize these groups by introducing the quite broad class of reducible automaton groups, which lies in the class of contracting automaton groups without singular points. We give a general structure theorem that shows that all reducible automaton groups are direct limit of poly-context-free groups which are virtually subgroups of the direct product of free groups; notice that this result partially supports a conjecture by T. Brough. Moreover, we prove that tree automaton groups with at least two generators are not finitely presented and they are amenable groups, which are direct limit of non-amenable groups.

This page was built for publication: On a class of poly-context-free groups generated by automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399504)