ab a,b (a) Convert this NFA into a DFA. Hint: In my answer, I was too lazy to write so many q's so I simplified 92 to simply 2. (b) If possible, label each state with some 3 character string that reaches this state. (e) Let Lo = {aaa, aab, aba, aba, abb} Let L1 = {0 = C... 03026 {a,b) | c = a} = {c {a,b) the 3rd last character is an a}. For example, bbbbabb is in the language and bbbbab is not. Let L2 = {a = C10203...n-1c. {a,b)' | =a} = {c {a,b} | the 3rd character is an a}. For example, bbabbbb is in the language and babbbb is not. Does M accept Lo, L1, L2, or some other language? (a) What does this DFA remember about the prefix of the string read so far? (e) Prove that no DFA computes L with fewer states than the one you constructed. Hint: My proof has three cases. In one of them, we compare the strings ?a? and ??. (1) Generalize the NFA above, replacing the path 919293 with a similar path with n states. H many states would the DF A computing the same language need? ab a,b (a) Convert this NFA into a DFA. Hint: In my answer, I was too lazy to write so many q's so I simplified 92 to simply 2. (b) If possible, label each state with some 3 character string that reaches this state. (e) Let Lo = {aaa, aab, aba, aba, abb} Let L1 = {0 = C... 03026 {a,b) | c = a} = {c {a,b) the 3rd last character is an a}. For example, bbbbabb is in the language and bbbbab is not. Let L2 = {a = C10203...n-1c. {a,b)' | =a} = {c {a,b} | the 3rd character is an a}. For example, bbabbbb is in the language and babbbb is not. Does M accept Lo, L1, L2, or some other language? (a) What does this DFA remember about the prefix of the string read so far? (e) Prove that no DFA computes L with fewer states than the one you constructed. Hint: My proof has three cases. In one of them, we compare the strings ?a? and ??. (1) Generalize the NFA above, replacing the path 919293 with a similar path with n states. H many states would the DF A computing the same language need