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
q
1
s
f
b
c
c
q
2
b
b
c
c
Illustration:
Q
DFA
=
{
{
s
}
}
a
{
s
}
For state {
s
}:
Add new states
{
q
1
,
f
}
,
{
q
2
,
f
}
to
Q
DFA
For state
{
q
1
,
f
}
: …
...
For state
{
q
2
,
f
}
: …
Add new states …
{
q
1
,
f
}
b
...
c
{
q
2
,
f
}
...
23
/44