It is undecidable whether a finite special string-rewriting system presents a group

It is shown that it is undecidable in general whether or not a monoid that is presented by a finite special string-rewriting system presents a group. The given proof uses the technique of canonical string-rewriting sytems.