Kleene theorem
= Kleene theorem
{c}
This theorem characterizes a <regular language> by <regular expressions> and acceptance by a <finite-state automaton>. Kleene's theorem states that a language is denoted by a regular expression exactly when it is accepted by a finite automaton.