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 ${\displaystyle V}$ is written as ${\displaystyle 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".

1. If ${\displaystyle V}$ is a set of strings, then ${\displaystyle V^{*}}$ is defined as the smallest superset of ${\displaystyle V}$ that contains the empty string ${\displaystyle \varepsilon }$ and is closed under the string concatenation operation.
2. If ${\displaystyle V}$ is a set of symbols or characters, then ${\displaystyle V^{*}}$ is the set of all strings over symbols in ${\displaystyle V}$, including the empty string ${\displaystyle \varepsilon }$.

The set ${\displaystyle 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 ${\displaystyle V}$, allowing the use of the same element multiple times. If ${\displaystyle V}$ is either the empty set ∅ or the singleton set ${\displaystyle \{\varepsilon \}}$, then ${\displaystyle V^{*}=\{\varepsilon \}}$; if ${\displaystyle V}$ is any other finite set or countably infinite set, then ${\displaystyle V^{*}}$ is a countably infinite set. As a consequence, each formal language over a finite or countably infinite alphabet ${\displaystyle \Sigma }$ is countable, since it is a subset of the countably infinite set ${\displaystyle \Sigma ^{*}}$.

The operators are used in rewrite rules for generative grammars.