This paper describes a systematic procedure which yields in a finite number of steps a solution to the following problem. Let G be a group generated by a finite set of generators g 1, g 2, g 3, . . . , gr and defined by a finite set of relations R 1 = R 2 = . . . = R k = I, where I is the unit element of G and R 1R 2, . . . , R k are words in the gi and gi -1. Let H be a subgroup of G, known to be of finite index, and generated by a finite set of words, W 1, W 2, . . . , Wt . Let W be any word in G. Our problem is the following. Can we find a new set of generators
for H, together with a set of representatives h 1 = 1, h 2, . . . , hu of the right cosets of H (i.e. G = H1 + Hh 2 + . . . + Hhu ) such that W can be expressed in the form W = Uhp , where U is a word in
.