Consider the following NFA $M$ and say what language is recognised by constructing the machine that recognises the complement of $L(M)$ in $\{a\}^*$.
$ \large{\colorbox{yellow}{Detailed video solution of this question with direct time stamp}}$ All India Mock Test 3 - Solutions Part 1
$\mathrm{D}$ - the language recognised by the original machine is $a^{+}$.
The question asks for the Complement of the language accepted by the NFA, not asking us to complement the states of the given NFA.
Complementing states in NFA may or may not result in NFA for language complement. Watch the following Complete Explanation from $01:03:56$ to $01:38:28.$ https://www.youtube.com/watch?v=zPIl_p2MiVY&t=3836s We have provided the Proof $\&$ All the reasons of "WHY" complementing states in NFA doesn't work.
64.3k questions
77.9k answers
244k comments
80.0k users
