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

摘要

设X1是由字母表X生成的自由幺半群，{B1，B2}是X的任意2一划分，C=B2UBl（XN＼B1N）UE，其中E=B1N＋1（B10B1UB281uUB22B1U…UB2M-1B1UB2MX），N≥3，M≥o，则C’是X’的幺子半群。以X’为顶点集构造了一个语言图，然后利用该语言图证明了G‘是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