Kleene's theorem states that regular languages can be defined by regular expressions, finite automata, or regular grammars.