Problem 1: NFA Properties (20)\ Show by giving an example that if

M

is an NFA that recognizes language

C

, swapping the accept and non-accept states in

M

doesn't necessarily yield a new NFA that recognizes the complement of

C

. Is the class of language recognized by NFAs closed by complement? Explain your answer. Hint: Remember equivalence and its power, and implication and its limitations.

Problem 1: NFA Properties (20) Show by giving an example that if M is an NFA that recognizes language C, swapping the accept and non-accept states in M doesn't necessarily yield a new NFA that recognizes the complement of C. Is the class of language recognized by NFAs closed by complement? Explain your answer. Hint: Remember equivalence and its power, and implication and its limitations