Stallings automata for free extensions

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.