Recognizable set

In computer science, more precisely in automata theory, a recognizable set is a class of subsets of monoids that are useful in automata theory, formal languages and algebra.

This notion is different from the notion of recognizable language. Indeed, the term "recognizable" has a different meaning in computability theory.

Definition

Let $N$ be a monoid, a submonoid $S\subseteq N$ is recognizable if there exists a morphism $\phi$ from $N$ to a finite monoid $M$ such that $S=\phi ^{-1}(\phi (S))$. This means that there exists a subset $T$ of $M$ (not necessarily a submonoid of $M$) such that the image of $S$ is in $T$ and the image of $N/S$ is in $M/T$.

Example

Let $A$ be an alphabet (computer science), the set $A^{*}$of words over $A$ is a monoid. The recognizable subset of $A^{*}$ are precisely the regular languages. Indeed this language is recognized by the transition monoid of any automaton that recognizes the language.

The recognizable subsets of $\mathbb {N}$ are the ultimately periodic sets of integers.

Property

The set $\mathrm {REC} (N)$ of recognizable subsets of $N$ is closed under:

• union
• intersection
• complement
• right and left quotient

McKnight's theorem states that if $N$ is finitely generated then its recognizable subsets are rational subsets.

The intersection of a rational subset and of a recognizable subset is rational.

References

• Straubing, Howard (1994). Finite automata, formal logic, and circuit complexity. Progress in Theoretical Computer Science. Basel: Birkhäuser. p. 79. ISBN 3-7643-3719-2. Zbl 0816.68086.
• [Mathematical Foundations of Automata Theory]