Example-07: Construct a NFA to accept language L={w |w contain an even number of 0’s or exactly two 1’s} over ∑={0,1}

SOLUTION:

        Transition diagram:

         Transition table:

Present State	Next State
	Input 0	Input 1
à q0	{q4}	{q1}
q1	∅	{q2}
*q2	{q3}	∅
q3	{q2}	∅
q4	{q2}	∅