I know that if there are no non-final states in DFA then the language accepted is $\Sigma^*$.
What will happen if there are no non-final states in an NFA? Can we say it also accepts $\Sigma^*$? Can there be an NFA with no non-final states whose minimal NFA has some non-final state?
Oh , no nonfinal states means all are final states. So DFA - all final states means every string gets accepted. So language is $\sum^*$. For NFA, it need not be $\sum^*$. Please correct me if i am wrong here. Other case --> If there are no final states(all non-final states) means in DFA, language accepted is empty language. In case of NFA with no final state means empty language right?