Algorithm II: e-free FA to DFA 1/2
 Gist:
Analogy to the previous algorithm except that only sets of accessible states are introduced.
b
a
a
q1
s
f
b
c
c
q2
b
b
c
c
Illustration:
QDFA = {{s}}
a
{s}
For state {s}:
Add new states {q1, f }, {q2, f } to QDFA
For state {q1, f }: …
...
For state {q2, f }: …
Add new states …
{q1, f }
b
...
c
{q2, f }
...
23/44