Theorem of Kleene
In Automata theory, the theorem of Kleene affirms that a language is rational if and only if he is recognized by a Finite-state machine. This theorem is due to Stephen Kleene.
It is an essential theorem of the formal languages, since it establishes the link between rational Expression and automat.
See too
-
Lemma of the star
| Random links: | Cuverville (Apple-brandy) | Ketene | Standard signal box PIPC | Vions | Carlo Cecchi | Caius Marcius Rutilus Censorinus | Rio_Grande,_New_Jersey |