‘Cancellativity is undecidable for automatic semigroups’
The Quarterly Journal of Mathematics 57, no. 3 (September 2006), pp. 285–295.
DOI: 10.1093/qmath/hai023
Via an encoding of the Modified Post's Correspondence Problem, this paper shows that it is undecidable whether an automatic semigroup is cancellative.