Myhill-Nerode theorem for semigroups


Let S be a semigroupPlanetmathPlanetmath. XS is recognizable if 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 ϕ:ST such 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 languages to 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 above if and only if it is recognizable by a DFA.

The equivalence of points 1, 2 and 3 is attributed to John Myhill, while the equivalence of points 1, 4 and 5 is 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 ϕ:ST with T finite and X=ϕ-1(ϕ(X)), put sχt iff ϕ(s)=ϕ(t).

Since ϕ is a morphism, χ is a congruence; moreover, X=ϕ-1(ϕ(X)) means that X is union of classes of χ-equivalence. By the maximality property of syntactic congruence, the number of classes of X does 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𝒩Xs2 for every S, determining [s]X is the same as determining [s]𝒩X as varies in S, plus the class [s]NX. (This additional class takes into account the possibility that 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]𝒩X then [1s]𝒩X=[2s]𝒩X as well. To determine [s]X it is thus sufficient to determine the [ξis]𝒩X for 1iK, plus [s]𝒩X.

We can thus identify the class [s]X with the sequence ([ξ1s]𝒩X,,[ξKs]𝒩X,[s]𝒩X). Then the number of classes of X cannot 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.

Title Myhill-Nerode theorem for semigroups
Canonical name MyhillNerodeTheoremForSemigroups
Date of creation 2014-05-14 17:29:14
Last modified on 2014-05-14 17:29:14
Owner Ziosilvio (18733)
Last modified by Ziosilvio (18733)
Numerical id 5
Author Ziosilvio (18733)
Entry type Theorem
Classification msc 20M35
Classification msc 68Q70
Defines recognizable subset of a semigroup