Example-08: Construct a NFA to accept language L={w ∈ {0,1} } w contains substring 0101

Transition diagram:

Transition table:

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