a) Find an nfa with three states that accepts the language L = {a" : n > 1} Ub"a*: m20, k >0. 2 0, k 2 0}. %3D (b) Do you think the language in part (a) can be accepted by an nfa with fewer than three...

1} Ub"a*: m20, k >0. 2 0, k 2 0}. %3D (b) Do you think the language in part (a) can be accepted by an nfa with fewer than three states? "/>
Extracted text: a) Find an nfa with three states that accepts the language L = {a" : n > 1} Ub"a*: m20, k >0. 2 0, k 2 0}. %3D (b) Do you think the language in part (a) can be accepted by an nfa with fewer than three states?