Rational set

In computer science, more precisely in automata theory, a rational set of a monoid is an element of the minimal class of subsets of this monoid that contains all finite subsets and is closed under union, product and Kleene star. Rational sets are useful in automata theory, formal languages and algebra.

A rational set generalizes the notion of rational (or regular) language (understood as defined by regular expressions) to monoids that are not necessarily free.

Definition

Let $(N,\cdot )$ be a monoid with identity element $e$. The set $\mathrm {RAT} (N)$ of rational subsets of $N$ is the smallest set that contains every finite set and is closed under

• union: if $A,B\in \mathrm {RAT} (N)$ then $A\cup B\in \mathrm {RAT} (N)$
• product: if $A,B\in \mathrm {RAT} (N)$ then $A\cdot B=\{a\cdot b\mid a\in A,b\in B\}\in \mathrm {RAT} (N)$
• Kleene star: if $A\in \mathrm {RAT} (N)$ then $A^{*}=\bigcup _{i=0}^{\infty }A^{i}\in \mathrm {RAT} (N)$ where $A^{0}=\{e\}$ is the singleton containing the identity element, and where $A^{n+1}=A^{n}\cdot A$.

This means that any rational subset of $N$ can be obtained by taking a finite number of finite subsets of $N$ and applying the union, product and Kleene star operations a finite number of times.

In general a rational subset of a monoid is not a submonoid.

Example

Let $A$ be an alphabet, the set $A^{*}$ of words over $A$ is a monoid. The rational subset of $A^{*}$ are precisely the regular languages. Indeed, the regular languages may be defined by a finite regular expression.

The rational subsets of $\mathbb {N}$ are the ultimately periodic sets of integers. More generally, the rational subsets of $\mathbb {N} ^{k}$ are the semilinear sets.

Properties

McKnight's theorem states that if $N$ is finitely generated then its recognizable subset are rational sets. This is not true in general, since the whole $N$ is always recognizable but it is not rational if $N$ is infinitely generated.

Rational sets are closed under homomorphism: given $N$ and $M$ two monoids and $\phi :N\rightarrow M$ a monoid homomorphism, if $S\in \mathrm {RAT} (N)$ then $\phi (S)=\{\phi (x)\mid x\in S\}\in \mathrm {RAT} (M)$.

$\mathrm {RAT} (N)$ is not closed under complement as the following example shows. Let $N=\{a\}^{*}\times \{b,c\}^{*}$, the sets $R=(a,b)^{*}(1,c)^{*}=\{(a^{n},b^{n}c^{m})\mid n,m\in \mathbb {N} \}$ and $S=(1,b)^{*}(a,c)^{*}=\{(a^{n},b^{m}c^{n})\mid n,m\in \mathbb {N} \}$ are rational but $R\cap S=\{(a^{n},b^{n}c^{n})\mid n\in \mathbb {N} \}$ is not because its projection to the second element $\{b^{n}c^{n}\mid n\in \mathbb {N} \}$ is not rational.

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

For finite groups the following result of A. Anissimov and A. W. Seifert is well known: a subgroup H of a finitely generated group G is recognizable if and only if H has finite index in G. In contrast, H is rational if and only if H is finitely generated.

Rational relations and rational functions

A binary relation between monoids M and N is a rational relation if the graph of the relation, regarded as a subset of M×N is a rational set in the product monoid. A function from M to N is a rational function if the graph of the function is a rational set.

See also

• Rational series
• Recognizable set
• Rational monoid

References

• Diekert, Volker; Kufleitner, Manfred; Rosenberg, Gerhard; Hertrampf, Ulrich (2016). "Chapter 7: Automata". Discrete Algebraic Methods. Berlin/Boston: Walter de Gruyther GmbH. ISBN 978-3-11-041332-8.
• Jean-Éric Pin, Mathematical Foundations of Automata Theory, Chapter IV: Recognisable and rational sets
• Samuel Eilenberg and Marcel-Paul Schützenberger, Rational Sets in Commutative Monoids, Journal of Algebra, 1969.

Further reading

• Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge University Press. Part II: The power of algebra. ISBN 978-0-521-84425-3. Zbl 1188.68177.