  We present an algorithmic approach to the conjugacy problems in monoids,
using rewriting systems. We extend the classical theory of rewriting developed
by Knuth and Bendix to a rewriting that takes into account the cyclic
conjugates.
