1.

(a) Use Kleens Theorem part 1 to create an NFA that accepts the language

defined by the regular expression (ab)(a + b).

(b) Show that the word a is accepted by your NFA in Part (a).

(c) Consider the NFA M = (Q, , q0, A, ) with no -transitions where Q ={q0,q1,q2}, = {a,b}, A = {q2} and

	a	b
q0	{q1}	{q0}
q1	{q2}	{q1}
q2		{q2}

Use the subset construction method to find an FA for this NFA.

(d) Find the minimum FA from the NFA in Part (c).