Word problem for semigroups presented by a single relation
Zhen Qi · Ha'erbin gongye daxue xuebao · 2000
We have proved the word problem for semigroups and monoids presented by a single relation A; a=bua is decidable, where A is a alpyabet (i.e. a generated set), a,b∈A, u∈a,b *. The method is utilizing a pseude algorithm due to Adjan, thus have proved that the pseude-algorithm is a algorithm for the problem, and have preliminarily given the greatest limit for utilizing the method.