We prove that the set of limit groups is recursively enumerable, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions ((à la Long and Reid) is coherent and, furthermore, there exists an algorithm that computes presentations for finitely generated subgroups. The other main ingredient is the ability to algorithmically calculate centralizers in relatively hyperbolic groups. Applications include the existence of recognition algorithms for limit groups and free groups.
Cite this article
Daniel Groves, Henry Wilton, Enumerating limit groups. Groups Geom. Dyn. 3 (2009), no. 3, pp. 389–399