Kleene's theorem

Home > Languages > Formal Language > Finite Automata > Kleene's theorem

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