Kleene closure

In mathematical logic and computer science, the Kleene star (or Kleene operator or Kleene closure) is a unary operation, either on sets of strings or on sets of symbols or characters. In mathematics,
it is more commonly known as the free monoid construction. 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 characterize certain automata, where it means "zero or more repetitions".

# If $V$ is a set of strings, then ''$V^*$'' is defined as the smallest superset of $V$ that contains the empty string $\varepsilon$ and is closed under the string concatenation operation.
# 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 $\varepsilon$.

The set ''$V^*$'' can also be described as the set containing the empty string and all finite-length strings that can be generated by concatenating arbitrary elements of $V$, allowing the use of the same element multiple times. If $V$ is either the empty set ∅ or the singleton set $\$, then $V^=\$; if $V$ is any other finite set or countably infinite set, then ''$V^*$'' is a countably infinite set. As a consequence, each formal language over a finite or countably infinite alphabet $\Sigma$ is countable, since it is a subset of the countably infinite set $\Sigma^$.

The operators are used in rewrite rules for generative grammars.

Definition and notation

Given a set $V$
define
:$V^=\$ (the language consisting only of the empty string),
:$V^=V$
and define recursively the set
:$V^=\$ for each $i>0$.

If $V$ is a formal language, then $V^i$, the $i$-th power of the set $V$, is a 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 that can be represented as the concatenation of $i$ strings in $V$.

The definition of Kleene star on $V$ is

:$V^*=\bigcup_V^i = V^0 \cup V^1 \cup V^2 \cup V^3 \cup V^4 \cup \cdots.$

This means that the Kleene star operator is an idempotent unary operator: $(V^)^=V^$ for any set $V$ of strings or characters, as $(V^)^=V^$ for every $i\geq 1$.

Kleene plus

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^$ term in the above union. In other words, the Kleene plus on $V$ is

:$V^+=\bigcup_ V^i = V^1 \cup V^2 \cup V^3 \cup \cdots.$

or

:$V^+ = V^*V$ This equation holds because every element of ''V''⁺ must either be composed from one element of ''V'' and finitely many non-empty terms in ''V'' or is just an element of ''V'' (where ''V'' itself is retrieved by taking ''V'' concatenated with ε).

Examples

Example of Kleene star applied to set of strings:
: ^* = .

Example of Kleene plus applied to set of characters:
: ⁺ = .
Kleene star applied to the same character set:
: ^* = .

Example of Kleene star applied to the empty set:
:∅^* = .

Example of Kleene plus applied to the empty set:
:∅⁺ = ∅ ∅^* = = ∅,
where concatenation is an associative and noncommutative product.

Example of Kleene plus and Kleene star applied to the singleton set containing the empty string:
:If $V=\$, then also $V^=\$ for each $i$, hence $V^=V^=\$.

Generalization

Strings form a monoid with concatenation as the binary operation and ε the identity element. The Kleene star is defined for any monoid, not just strings.
More precisely, let (''M'', ⋅) be a monoid, and ''S'' ⊆ ''M''. Then ''S''^* is the smallest submonoid of ''M'' containing ''S''; that is, ''S''^* contains the neutral element of ''M'', the set ''S'', and is such that if ''x'',''y'' ∈ ''S''^*, then ''x''⋅''y'' ∈ ''S''^*.

Furthermore, the Kleene star is generalized by including the *-operation (and the union) in the algebraic structure itself by the notion of complete star semiring.

See also

* Wildcard character
* Glob (programming)

References

Further reading

*{{cite book , last1=Hopcroft , first1=John E. , author-link1=John Hopcroft , last2=Ullman , first2=Jeffrey D. , author-link2=Jeffrey Ullman , date=1979 , title=Introduction to Automata Theory, Languages, and Computation , title-link=Introduction to Automata Theory, Languages, and Computation , edition=1st , publisher=Addison-Wesley

Formal languages
Grammar
Natural language processing