Theory of Computation

5. Do Exercise 4 of Section 2.3 at page 64.

use table for both NFA and DFA then draw graphs for both,

please explain each step clearly.

@ Convert the nfa defined by 6(go, a) = {go, ql} 6(q1, b) == {q1, q2} 6(q2 , a) = {92} 42, a) = 142 6(go,A) = {q2} with initial state qo and final state q2 into an equivalent dia. 12 qq 0122 qqqqo {{{{ t 0120