幺半群S=〈a,b,c|abc=1〉的结构

On Monoid S=〈a,b,c| abc=1〉

给出了幺半群S字问题的解,即{a,b,c}*中任意两个字w,z在同一个由{(abc,1)}生成的同余类的充要条件,定义了S的任意元素的分解式,刻画了它的G reen等价关系,验证了其元素的正则性.

In this paper, the answer of the words problem for monoid S is given, that is, the sufficient and necessary condition for any two words w,z in {a,b,c}^＊ to be in the same congruence class generated by {（abc,1）}. Also, the Green＇s equivalances of this monoid are characterized by defining a special word decomposition. Finally the regularity of elements is verified.