半群语言与正规语言

On the semigroup languages and the regular languages

利用三元关系定义半群语言(半群的子集),初步讨论了半群语言的代数性质,然后证明了非空有限集合∑上的自由半群∑*的半群语言类与有穷状态自动机所接受的正规语言类是一致的。

In this paper, we introduce a concept, semigroup languages, in a semigroup by using a triple relation. It is proved that the class of semigroup languages of $ S $ , the free semigroup generated by a nonempty finite set ∑, coincides with the class of regular languages over ∑.