Regular completions of -free groups
arXiv:1208.4640
Abstract
In the present paper we continue studying regular free group actions on -trees. We show that every finitely generated -free group can be embedded into a finitely generated -free group acting regularly on the underlying -tree (we call a {\em regular -completion} of ) so that the action of is preserved. Moreover, if is effectively represented as a group of -words then the construction of is effective and is also effectively represented as a group of -words.
22 pages