Theory-of-computation

Question

I read the foll statement somewhere..

Is it true?

In nfa if there is a dead configuration then its equivalent dfa may or may not have trap state.

Acc to me it will always  have a trap state for that particular nfa.

??

Comments

I also agree with you