Example-05: Construct a NFA to accept strings which end with ‘aa’ over ∑={a,b}

SOLUTION:

Transition diagram:

Transition table:

Present State	Next State
	Input a	Input b
à q0	{q0,q1}	{q0}
q1	{q2}	∅
*q2	{q2}	{q0}