The conjugacy problem in semigroups and monoids
Group Theory
2009-11-04 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0911.0524,
title = {The conjugacy problem in semigroups and monoids},
author = {Fabienne Chouraqui},
journal= {arXiv preprint arXiv:0911.0524},
year = {2009}
}