Myhill-Nerode theorem for semigroups
Let be a semigroup. is recognizableif it is union of classes of a congruence
such that is finite.
In the rest of the entry, will be the syntactic congruence of ,and its Nerode equivalence.
Theorem 1 (Myhill-Nerode theorem for semigroups)
Let be a semigroup and let .The following are equivalent.
- 1.
is recognizable.
- 2.
There exist a finite semigroup and a morphism such that .
- 3.
The syntactic semigroup of is finite.
- 4.
There exists an equivalence relation on such that
- –
is finite and
- –
implies .
- –
- 5.
The quotient set 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 language 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 and is union of classes of ,choose as the quotient semigroup and as the natural homomorphism mapping to .
2 3.Given a morphism of semigroups with finite and ,put iff .
Since is a morphism, is a congruence;moreover, means that is union of classes of -equivalence.By the maximality property of syntactic congruence,the number of classes of does not exceed the number of classes of ,which in turn does not exceed the number of elements of .
3 1.Straightforward from being union of classes of .
3 4.Straightforward from satisfying the second requirement.
4 5.Straightforward from the maximality property of Nerode equivalence.
5 3.Let
(1) |
Since iff for every ,determining is the same as determining as varies in ,plus the class .(This additional class takes into account the possibilitythat for any ,which cannot be excluded a priori:do not forget that is not required to be a monoid.)
But since implies ,if then as well.To determine it is thus sufficient to determine the for ,plus .
We can thus identify the class with the sequenceThen the number of classes of cannot exceed that of -ples of classes of ,which is .
References
A. de Luca and S. Varricchio.Finiteness and Regularity in Semigroups and Formal Languages.Springer Verlag, Heidelberg 1999.