C0NSIDER THE NFA N = ({S, A, B}, {a,b} ,S,{B})

WITH TRANSITI0NS,

(S,a) = {S,A}

(A,b) = {A,B}

(B,a) = {B}

DRAW THE TRANSlTl0N GRAPH F0R THE NFA.

C0NVERT THE NFA lNT0 AN EQUlVALENT DFA.

THE DFA SHOULD HAVE ONE A AND ONE B FOR EACH STATE.

THE DFA SHOULD HAVE ONE A AND ONE B FOR EACH STATE.

THE DFA SHOULD HAVE ONE A AND ONE B FOR EACH STATE.

THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA.THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA.THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA.THIS IS NOT A DFA. THIS IS NOT A DFA. THIS IS NOT A DFA.