Theorem 6 ([
Re95,
MaRe95])
Let
be a finite string rewriting system presenting a group
and without loss of generality for all
we assume that
l and
r are free reduced words.
We associate the set of polynomials
in
with
T.
Then for
the following statements are equivalent:
- (1)
-
.
- (2)
-
.