CLASS 12 : NDFA TO DFA CONVERSION EXAMPLE

Q = { q0, q1, q2 }

2^Q = { [φ], [q0], [q1], [q2], [q0, q1], [q0, q2], [q1, q2], [q0, q1, q2] }

Σ = { 0, 1}

q0 = q0

F = {q2}

Draw transition graph according to above transition table.

Now Discard Unreachable states from graph ( जिन   स्टेट्स तक नहीं पहुचपा रहे है उनको हटा देना )  then we get new graph:

After Discard / Reject states the graph will be: 

Here q2 state is unreachable so discard it.

Now change the levels of states in graph :

Q  = {A,B,C}

Σ  = {0,1}

q0 = A

F = {C}

Transition Table (δ) will be :

SHORT CUT METHOD :

I already explain about short cut method For Review / देखने के लिए Click on Short Cut Method

Now the Transition table will be: