I hope this will work for u to understand HOW TO CONVERT AN NFA TO DFA

This is an NFA with intial stae 0 and final state 10. Here input symbols are {a,b}. This NFA accept the language (a+b)*abb.

CONVERSION OF NFA TO DFA 1. Starting from initial state which is 0 (0,)={0,1,2,4,7}=A This states that after giving the null input to intial state it reaches to thees states and we denote the set of these states as A.

2. Now we compute the move (A,a)={1,2,3,4,6,7,8}=B. 3. Now we compute (A,b)={1,2,4,5,6,7}=C.

4.

Similarly we give the inputs (a,b)to other sets like B,C and so on and get five different sets of states to construct the DFA. These states are A={0,1,2,4,7}, B={1,2,3,4,6,7,8}, C={1,2,4,5,6,7}, D={1,2,4,5,6,7,9}, E={1,2,4,5,6,7,10}.

Heere A is the starting state and D is the only final state coz it contians the final state of NFA i.e, 10. The transition table for DFA is given below:

state A B C D E

Input symbol a B B B B B

Input symbol b C D C E C

This should be noted that the DFA of the given NFA accepts the same language as the language accepted by the NFA i.e, (a+b)*abb. The diagram of DFA is given below: