Kleene's algorithm: Difference between revisions

Content deleted Content added
Line 19:
 
==Example==
[[File:Deterministicfiniteautomaton.svg|thumb|200px150px|Example DFA given to Kleene's algorithm]]
 
The automaton shown in the picture can be described as ''M'' = (''Q'', Σ, δ, ''q''<sub>0</sub>, ''F'') with
* the set of states ''Q'' = { ''q''<sub>0</sub>, ''q''<sub>1</sub>, ''q''<sub>2</sub> },
* the input alphabet Σ = { ''a'', ''b'' },
* the transition function δ with δ(''q''<sub>0</sub>,''a'')=''q''<sub>0</sub>, &nbsp; δ(''q''<sub>0</sub>,''b'')=''q''<sub>1</sub>, &nbsp; δ(''q''<sub>1</sub>,''a'')=''q''<sub>2</sub>, &nbsp; δ(''q''<sub>1</sub>,''b'')=''q''<sub>1</sub>, &nbsp; δ(''q''<sub>2</sub>,''a'')=''q''<sub>1</sub>, and δ(''q''<sub>2</sub>,''a'')=''q''<sub>1</sub>,
* the start state ''q''<sub>0</sub>, and
* set of accept states ''F'' = { ''q''<sub>1</sub> }.
 
==References==