Theorem 1 The word problem for any 1-relator monoids can be reduced to the left side divisibility problem for monoids M presented in 2 generators by 1 defining relation of the form aU = bV . For the solution of this problem it sufficies to find an algorithm to recognize for any word aW (or for any word bW ) whether or not it is left side divisible in M by the letter b (accordingly by the letter...

The principal result of this paper is a reduction of the word problem for one relator semigroups. Crudely, a relator (w,w′) on the alphabet X is achievable if the letters in the relator can actively participate in sequences of transitions for the semigroup presentation 〈X ; (w,w′)〉. (A precise definition of achievable relators is given in section 3.) Empirically, achievable relators are rare. W...