由单关系式<A;a=bua>显示的半群的字问题

Word problem for semigroups presented by a single relation <A; a=bua>

证明了由单关系式 <A ;a =bua >显示的半群或么半群字问题是可判定的 ,其中 A 为某字母表 ,a ,b∈A ,u∈ <a ,b > .方法是利用Adjan伪算法 ,因而证明了Adjan伪算法对此问题是算法 。

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.