I. Check the strings reaching the final state
{ a,aa,aaa,aaaa,......} = a+ , or, { all strings over {a}, except ∊}
II. Remove ∊-moves
∊-closure(q0) = {q0}
∊-closure(q1) = {q0,q1,q2}
∊-closure(q2) = {q0,q2}
NFA with ∊-moves to NFA
States\Symbols |
a |
---|
->q0 |
{q0,q1,q2} |
q1* |
{q0,q1,q2} |
q2 |
{q0,q1,q2} |
DFA
States\Symbols |
a |
---|
->q0 |
{q0,q1,q2} |
{q0,q1,q2}* |
{q0,q1,q2} |
L = a+ = {a,aa,aaa,aaaa,aaaaa,....}