Kleene star

From Wikipedia, the free encyclopedia

In mathematical logic and computer science, the Kleene star (or Kleene closure) is a unary operation, either on sets of strings or on sets of symbols or characters. The application of the Kleene star to a set V is written as V*. It is widely used for regular expressions, which is the context in which it was introduced by Stephen Kleene to characterise certain automata.

If V is a set of strings then V* is defined as the smallest superset of V that contains λ (the empty string) and is closed under the string concatenation operation. This set can also be described as the set of strings that can be made by concatenating zero or more strings from V.
If V is a set of symbols or characters then V* is the set of all strings over symbols in V, including the empty string.

1 Definition and notation
2 Examples
3 Generalization
4 See also

[edit] Definition and notation

Given

$V_0=\{\lambda\}\,$

define recursively the set

$V_{i+1}=\{wv : w\in V_i \mbox{ and } v \in V\}\,$ where $i \ge 0\,.$

If $V$ is a formal language, then the $i$ -th power of the set $V$ is shorthand for the concatenation of set $V$ with itself $i$ times. That is, $V i$ can be understood to be the set of all strings of length $i$ , formed from the symbols in $V$ .

The definition of Kleene star on $V$ is $V^*=\bigcup_{i \in \N} V_i = \left \{\lambda \right\} \cup V_1 \cup V_2 \cup V_3 \cup \ldots$

That is, it is the collection of all possible finite-length strings generated from the symbols in $V$ .

In some formal language studies, (e.g. AFL Theory) a variation on the Kleene star operation called the Kleene plus is used. The Kleene plus omits the $V 0$ term in the above union. In other words, the Kleene plus on $V$ is $V^+=\bigcup_{i \in \N^{\star}} V_i = V_1 \cup V_2 \cup V_3 \cup \ldots$