The Word Problem for Cancellation Semigroups with Zero
In 1947, Post showed the word problem for semigroups to be undecidable. In 1950, Turing strengthened this result to cancellation semigroups, i.e. semigroups satisfying the cancellation property (1) if xy = xz or yx = zx then y = z. No semigroups with zero satisfies…