The word problem for free adequate semigroups
Mark Kambites, Alexandr Kazda · International Journal of Algebra and Computation · 2014
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence to test whether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.