Course contentsShow
← Computer Science
Lesson 1770 of 2,87240. Theory of Computation: Regular LanguagesFree lesson

Kleene Star and Repetition

Master the Kleene star operator for zero-or-more repetitions and express patterns with arbitrary repetition.

Kleene Star and Repetition

What you'll learn: How the Kleene star operator (*) expresses zero-or-more repetitions of patterns in regular expressions.

The Core Idea

The Kleene star (named after mathematician Stephen Kleene) is a unary operator that takes a pattern and matches it zero or more times. When you write a* in a regular expression, you're saying "match zero or more consecutive a characters."

This is incredibly powerful because it lets you describe infinite sets of strings with finite notation:

  • a* matches: ε (empty string), a, aa, aaa, aaaa, ...
  • (ab)* matches: ε, ab, abab, ababab, ...
  • (0|1)* matches: any binary string including the empty string

Common Patterns with Repetition

The Kleene star enables expressing common real-world patterns:

  • Optional whitespace followed by content: \s*content (zero or more spaces, then "content")
  • Repeated digits: [0-9]* matches any sequence of digits or nothing at all
  • Nested structures: (open(close)*)* allows arbitrary nesting

Important Property

Remember that * includes zero repetitions, so the pattern always matches at least the empty string. This differs from the Kleene plus (+), which requires one or more repetitions.

Think of * as "as many as you want, including none" – like an all-you-can-eat buffet where not eating is also an option!

Key Takeaway: The Kleene star (*) is the fundamental repetition operator in regular expressions, matching zero or more consecutive occurrences of a pattern and enabling concise descriptions of infinite string sets.