It's known that the complement of a DFA can be easily formed. That is, given a machine $M$, we can construct $M'$ such that $L(M') = \Sigma^* \setminus L(M)$.Is it possible to construct such a complement for a non-deterministic finite automation (NFA)? To my knowledge, it isn't.
Complement of Non deterministic Finite Automata
automata;finite automata;closure properties