we have shown that if M is a DFA that recognizes a language A then we can obtain a DFA M' that recognizes by swapping accept and non-accept states in M.

(a) Show, by giving an example, that if M is an NFA that recognizes a language B then we do not necessarily obtain an NFA recognizing by swapping accept and non-accept states in M.

(b) Is the class of languages recognized by NFAs closed under complement? Explain your answer.

Transcribed image text