Example-06: Construct a NFA to accept strings with either two consecutive 0’s or two consecutive 1’s over ∑={0,1}

SOLUTION:

Transition diagram:

Transition table:

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