1. You need to add at-least two more states and at least 3 more transitions on top of the following ? -NFA to
construct a new ? -NFA.
Now, find ?-closure (A, B) and ?-closure (E, F) from your constructed ?-NFA. Then use subset construction
method to convert your constructed ?-NFA to an equivalent DFA.
?
0
A
C
E
?
0
0
0
0
B
D
F
1
1
[6]
2 You need to construct a DFA that includes at least 10 states each of which has exactly two outgoing [6]
transitions with input symbols 0 and 1. Now, use the table filling method to minimize the constructed
DFA.
3. Now, you need to take a string having length 6 or more, then check whether this string is accepted or not in [6]
the minimized DFA of Question 2 by using extended transition function. Your string should only contain 0's
and 1's.