Algorithm: e-free FA to DFA 1/2
 Gist:
In DFA, make states from all subsets of states in e-free FA and move between them so that all possible states of e-free FA are simultaneously simulated.
q1
s
b
f
b
c
c
a
q2
a
b
b
c
c
Illustration:
QDFA = {{s}, {q1}, {q2}, { f}, {s,q1}, {s,q2}, {s, f}, {q1,q2}, {q1, f}, {q2, f}, {s,q1,q2}, {s,q1, f}, {s,q2, f}, {q1,q2, f}, {s,q1,q2, f}}
a
c
{q2, f }
...
{q1, f }
b
...
For state {s, f}:
{s, f}
For state {s}: …
...
...
For state {s,q1,q2, f}: …
14/44