A list of applications of Stallings automata

Abstract

This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently, results concerning finitely generated subgroups have greater prominence in the paper. However, when possible, we try to state the results with more generality, including the usually overlooked non-(finitely-generated) case.

arXiv comment77 pages, 16 figures (version 1.01)

References in corpus (10)

• Finite index subgroups of fully residually free groups
• Random quotients of the modular group are rigid and essentially incompressible
• A remark on Whitehead's Lemma
• On algebraic extensions and decomposition of homomorphisms in free groups
• The Herzog-Schonheim conjecture for finitely generated groups
• On the genericity of Whitehead minimality
• Membership Problem in groups acting freely on Z^n-trees
• Controlled Floyd Separation and Non Relatively Hyperbolic Groups
• On the intersections of finitely generated subgroups of free groups: reduced rank to full rank
• About an extension of the Davenport-Rado result to the Herzog-Schonheim conjecture for free groups