Question: 1. (10 + 30 + 10 = 50 points) The following DFA MI over = {a,b} accepts the language of all strings where every 'a'

1. (10 + 30 + 10 = 50 points) The following DFA MI over = {a,b} accepts the language of all strings where every 'a' is immediately followed by a b'. MI: b a 90 91 b (a) Write an English description of the complement of DFA Ml's language. (b) Create a DFA M2 that recognizes L(M1). Create M2 directly from M1 using the method of changing the types of the states as described in class. (c) DFA M2 does not accept 1, bb, abab, but accepts aba and aab. Are these results correct? Explain your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
