@article {10983, title = {Decidability and Independence of Conjugacy Problems in Finitely Presented Monoids}, journal = {Theoretical Computer Science}, volume = {731}, year = {2018}, pages = {88-98}, abstract = {

There have been several attempts to extend the notion of conjugacy from groups to monoids.
The aim of this paper is study the decidability and independence of conjugacy problems
for three of these notions (which we will denote by $\sim_p$, $\sim_o$, and $\sim_c$) in
certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids,
$p$-conjugacy is {\textquoteleft}{\textquoteleft}almost{\textquoteright}{\textquoteright} transitive, $\sim_c$ is strictly included in $\sim_p$, and
the $p$- and $c$-conjugacy problems are decidable with linear compexity.
For other classes of monoids, the situation is more complicated.
We show that there exists a monoid $M$ defined by a finite complete
presentation such that the $c$-conjugacy problem for $M$ is undecidable, and
that for finitely presented monoids, the $c$-conjugacy problem and the word
problem are independent, as are the $c$-conjugacy and $p$-conjugacy problems.

}, url = {https://doi.org/10.1016/j.tcs.2018.04.002}, author = {J. Ara{\'u}jo and Kinyon, M. and Konieczny, J. and Malheiro, A.} }