Chapter 10: Kleene's Theorem
Conditions d’achèvement
Kleene’s Theorem
Translation from automata to regular expressions:
-
Equations associated with the states of an automaton.
Arden’s Lemma. -
State elimination method.
-
Equations associated with the paths of an automaton.
Translation from regular expressions to NFA and DFA:
-
Compositional translation to NFA.
-
Translation by computing the derived DFA of a regular expression.