On the transition monoid of the Stallings automaton of a subgroup of a free group
DOI10.1142/s0218196723500224zbMath1527.20046arXiv2111.13561OpenAlexW4321791656MaRDI QIDQ6159131
Publication date: 1 June 2023
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.13561
Formal languages and automata (68Q45) Subgroup theorems; subgroup growth (20E07) Varieties and pseudovarieties of semigroups (20M07) Automorphisms of infinite groups (20E36) Semigroups in automata theory, linguistics, etc. (20M35) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite automata for Schreier graphs of virtually free groups
- Topology of finite graphs
- On pseudovarieties
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
- Combinatorial group theory.
- Stallings foldings and subgroups of free groups
- Stallings automata for free-times-abelian groups: intersections and index
- Rational subsets of groups
- Stallings graphs for quasi-convex subgroups
- On the structure of semigroups
- STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
- A list of applications of Stallings automata
This page was built for publication: On the transition monoid of the Stallings automaton of a subgroup of a free group
