A solvable conjugacy problem for finitely presented \(C(3)\) semigroups. (Q2447222)

Let \(S=\text{sgp}\langle X\mid R\rangle\) be a semigroup with generators \(X\) and defining relations \(R=\{r_i=s_i\mid i\in I\}\), where for any \(i\in I\), \(r_i,s_i\in X^*\) and \(X^*\) is the free monoid generated by \(X\). We call the individual \(r_i\)'s and \(s_k\)'s relators. A word \(z\in X^*\) is a piece if \(z\) appears as a factor in two distinct locations of a single relator or \(z\) appears as a factor in two distinct relators. The semigroup \(S\) satisfies \(C(n)\) if no relator of \(S\) can be written as a product of fewer that \(n\) pieces. In [A geometric approach for some algorithmic problems for semigroups. Ann Arbor: University of Michigan (PhD Thesis) (1971)], \textit{J. H. Remmers} introduced semigroup derivation diagrams and used them to prove that the word problem for finitely presented \(C(3)\) semigroups was solvable. In this article the authors introduce the annular analog of semigroup derivation diagrams and use them to demonstrate the solution to a conjugacy problem for finitely presented \(C(3)\) semigroups.