Detecting quasiconvexity: algorithmic aspects

Abstract

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$. This provides a practical, not just theoretical, procedure for solving the occurrence problem for such subgroups.

AMS-Tex, 7 pages, no figures. To appear in the Proceedings of the DIMACS meeting on Computational Group Theory (March 1994)

Cited by in corpus (1)

• Stallings graphs for quasi-convex subgroups