Buscar
Stallings automata for free extensions
- Jordi Delgado and Enric Ventura
- 29 may 2019
- 1 Min. de lectura
We generalize to extensions by free groups (G ⋊ 𝔽ₙ) the classical theory of Stallings describing subgroups of the free groups as automata.
This approach provides conditions for the solvability of the membership problem and provides insight on other important algorithmic problems for this family.
Entradas recientes
Ver todoIn this paper we delve into the behavior of multiple intersections of subgroups of free and free times free-abelian (FTA) groups with...
En aquest article revisem algunes de les propietats fonamentals del gruplliure i fem una exposició detallada de la teoria dels autòmats...
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the...
Comments