16. (10pts) Show the state diagram for an NFA, without e-moves and no more than three...

   

Transcribed Image Text:

16. (10pts) Show the state diagram for an NFA, without e-moves and no more than three states, that recognizes the language L = {w = {a,b}* | w ends with the two letters ab} Label your states 1, 2 and 3 with 1 being the start state. (10pts) Use the subset construction to build a DFA that recognizes the language recognized by the above NFA. Clearly show your steps so that it is clear that you used the subset construction. You must show all the states and indicate the accept states but you do not have to show the transition arrows for states that are not reachable. (10pts) In regards to the subset construction what is exponential blowup? Is it possible that there may be an algorithm that can avoid it in all cases? Justify your answer. 16. (10pts) Show the state diagram for an NFA, without e-moves and no more than three states, that recognizes the language L = {w = {a,b}* | w ends with the two letters ab} Label your states 1, 2 and 3 with 1 being the start state. (10pts) Use the subset construction to build a DFA that recognizes the language recognized by the above NFA. Clearly show your steps so that it is clear that you used the subset construction. You must show all the states and indicate the accept states but you do not have to show the transition arrows for states that are not reachable. (10pts) In regards to the subset construction what is exponential blowup? Is it possible that there may be an algorithm that can avoid it in all cases? Justify your answer.

Answer rating: 100% (QA)

a NFA Pag b 2 3 State table for ab... View the full answer