请输入您要查询的字词:

 

单词 MyhillNerodeTheoremForSemigroups
释义

Myhill-Nerode theorem for semigroups


Let S be a semigroupPlanetmathPlanetmath.XS is recognizableif it is union of classes of a congruencePlanetmathPlanetmathPlanetmathPlanetmath χsuch that S/χ is finite.

In the rest of the entry,X will be the syntactic congruence of X,and 𝒩X its Nerode equivalence.

Theorem 1 (Myhill-Nerode theorem for semigroups)

Let S be a semigroup and let XS.The following are equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath.

  1. 1.

    X is recognizable.

  2. 2.

    There exist a finite semigroup T and a morphism ϕ:STsuch that X=ϕ-1(ϕ(X)).

  3. 3.

    The syntactic semigroup of X is finite.

  4. 4.

    There exists an equivalence relation on S such that

    • S/ is finite and

    • s1s2 implies s1ts2t.

  5. 5.

    The quotient set S/𝒩X is finite.

Theorem 1 generalizes Myhill-Nerode theorem for languagesto subsets of generic, not necessarily free, semigroups.In fact, as a consequence of Theorem 1,a languagePlanetmathPlanetmath on a finite alphabet is recognizable in the sense given aboveif and only if it is recognizable by a DFA.

The equivalence of points 1, 2 and 3is attributed to John Myhill,while the equivalence of points 1, 4 and 5is attributed to Anil Nerode.

Proof of Theorem 1.

1 2.Given a congruence χ such that|S/χ|< and X is union of classes of χ,choose T as the quotient semigroup S/χand ϕ as the natural homomorphismMathworldPlanetmath mapping s to [s]χ.

2 3.Given a morphism of semigroups ϕ:STwith T finite and X=ϕ-1(ϕ(X)),put sχt iff ϕ(s)=ϕ(t).

Since ϕ is a morphism, χ is a congruence;moreover, X=ϕ-1(ϕ(X)) means thatX is union of classes of χ-equivalence.By the maximality property of syntactic congruence,the number of classes of Xdoes not exceed the number of classes of χ,which in turn does not exceed the number of elements of T.

3 1.Straightforward from X being union of classes of X.

3 4.Straightforward from X satisfying the second requirement.

4 5.Straightforward from the maximality property of Nerode equivalence.

5 3.Let

S/𝒩X={[ξ1]𝒩X,,[ξK]𝒩X}.(1)

Since s1Xs2 iff s1𝒩Xs2for every S,determining [s]Xis the same as determining [s]𝒩Xas varies in S,plus the class [s]NX.(This additional class takes into account the possibilitythat s[s]𝒩X for any S,which cannot be excluded a priori:do not forget that S is not required to be a monoid.)

But since s1𝒩Xs2 implies s1t𝒩Xs2t,if [1]𝒩X=[2]𝒩Xthen [1s]𝒩X=[2s]𝒩X as well.To determine [s]Xit is thus sufficient to determine the [ξis]𝒩Xfor 1iK,plus [s]𝒩X.

We can thus identify the class [s]Xwith the sequence([ξ1s]𝒩X,,[ξKs]𝒩X,[s]𝒩X).Then the number of classes of Xcannot exceed that of (K+1)-ples of classes of 𝒩X,which is KK+1.

References

A. de Luca and S. Varricchio.Finiteness and Regularity in Semigroups and Formal LanguagesMathworldPlanetmath.Springer Verlag, Heidelberg 1999.

    随便看

     

    数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

     

    Copyright © 2000-2023 Newdu.com.com All Rights Reserved
    更新时间:2025/5/4 16:19:55