自由幺半群X＇的一族极大自由幺子半群

A Family Maximal Free Submonoid of the Free Monoid X

设X*是由字母表X生成的自由幺半群,{B1,B2}是X的任意2-划分,C=B2∪B1(XN\B1N)∪E,其中E=B1N+1.(B10B1∪B2B1∪B22B1∪…∪B2M-1B1∪B2MX),N3,M0,则C*是X*的幺子半群。以X*为顶点集构造了一个语言图,然后利用该语言图证明了C*是X*的一族极大自由幺子半群。

Let X＊ be the free monoid generated by an alphabet X. Let { B1 ,B2 } be an arbitrary two-partition on X and C = B2 t.J B1 （ XN ／B1N） tA E, where E = B1N＋1 （ B1B1tA B2B1 U B22B1 U U BM-1 B1 U B2MX）, N 〉_ 3, M ≥0, then C are showia to he submonoids of the free monoid X This paper constructs a language diagram with X as node set , and proves that C are a family maximal free submonoids of the free monoid X