Knuth-Bendix algorithm and the conjugacy problems in monoids
arXiv:1012.3547 · doi:10.1007/s00233-010-9288-0
Abstract
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.
This is a new version of the paper 'The conjugacy problems in monoids and semigroups'. This version will appear in the journal 'Semigroup forum'