Content deleted Content added
Line 27:
* the start state ''q''<sub>0</sub>, and
* set of accept states ''F'' = { ''q''<sub>1</sub> }.
Kleene's algorithm computes the initial regular expressions as
{| class=wikitable
|-
| | ''R''{{su|p=-1|b=''00''}} = ''a'' | ε
| | ''R''{{su|p=-1|b=''01''}} = ''b''
| | ''R''{{su|p=-1|b=''02''}} = ∅
|-
| | ''R''{{su|p=-1|b=''10''}} = ∅
| | ''R''{{su|p=-1|b=''11''}} = ''b'' | ε
| | ''R''{{su|p=-1|b=''12''}} = ''a''
|-
| | ''R''{{su|p=-1|b=''20''}} = ∅
| | ''R''{{su|p=-1|b=''21''}} = ''a'' | ''b''
| | ''R''{{su|p=-1|b=''22''}} = ε
|}
Step 0:
{| class=wikitable
|-
| | ''R''{{su|p=0|b=''00''}} =
| | ''R''{{su|p=0|b=''01''}} =
| | ''R''{{su|p=0|b=''02''}} =
|-
| | ''R''{{su|p=0|b=''10''}} =
| | ''R''{{su|p=0|b=''11''}} =
| | ''R''{{su|p=0|b=''12''}} =
|-
| | ''R''{{su|p=0|b=''20''}} =
| | ''R''{{su|p=0|b=''21''}} =
| | ''R''{{su|p=0|b=''22''}} =
|}
Step 1:
{| class=wikitable
|-
| | ''R''{{su|p=1|b=''00''}} =
| | ''R''{{su|p=1|b=''01''}} =
| | ''R''{{su|p=1|b=''02''}} =
|-
| | ''R''{{su|p=1|b=''10''}} =
| | ''R''{{su|p=1|b=''11''}} =
| | ''R''{{su|p=1|b=''12''}} =
|-
| | ''R''{{su|p=1|b=''20''}} =
| | ''R''{{su|p=1|b=''21''}} =
| | ''R''{{su|p=1|b=''22''}} =
|}
Step 2:
{| class=wikitable
|-
| | ''R''{{su|p=2|b=''00''}} =
| | ''R''{{su|p=2|b=''01''}} =
| | ''R''{{su|p=2|b=''02''}} =
|-
| | ''R''{{su|p=2|b=''10''}} =
| | ''R''{{su|p=2|b=''11''}} =
| | ''R''{{su|p=2|b=''12''}} =
|-
| | ''R''{{su|p=2|b=''20''}} =
| | ''R''{{su|p=2|b=''21''}} =
| | ''R''{{su|p=2|b=''22''}} =
|}
==References==
| |||