Kleene star
Wikipedia, the free encyclopedia - Cite This SourceIn 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.
Definition and notation
Given- where
If is a formal language, then the -th power of the set is shorthand for the concatenation of set with itself times. That is, can be understood to be the set of all strings of length , formed from the symbols in .
The definition of Kleene star on is
That is, it is the collection of all possible finite-length strings generated from the symbols in .
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 term in the above union. In other words, the Kleene plus on is
Examples
Example of Kleene star applied to set of strings:
- {"ab", "c"}* = {ε, "ab", "c", "abab", "abc", "cab", "cc", "ababab", "ababc", "abcab", "abcc", "cabab", "cabc", "ccab", "ccc", ...}
Example of Kleene star applied to set of characters:
- {'a', 'b', 'c'}* = {ε, "a", "b", "c", "aa", "ab", "ac", "ba", "bb", "bc", ...}
Generalization
The Kleene star is often generalized for any monoid (M, ), that is, a set M and binary operation on M such that
- (closure)
- (associativity)
See also
- Kleene algebra
- Extended Backus-Naur form
- Pumping lemma
- Star height problem, generalized star height problem, star-free language
- Regular expressions
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Wednesday March 12, 2008 at 09:20:53 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation