%0 Journal Article
%T The conjugacy problem in semigroups and monoids
%A Fabienne Chouraqui
%J Mathematics
%D 2009
%I arXiv
%X We present an algorithmic approach to the conjugacy problems in monoids and semigroups, using rewriting systems. There is a class of monoids and semigroups that satisfy the condition that the transposi- tion problem and the left and right conjugacy problem are equivalent. The free monoid and the completely simple semigroups belong to this class. We give a solution to the conjugacy problem for monoids and semigroups in this class that are presented by a complete rewriting system that satisfies some additional conditions.
%U http://arxiv.org/abs/0911.0524v1