Kleene theorem

Kleene's theorem states that a language is denoted by a regular expression exactly when it is accepted by a finite automaton.