self made

Question

I know it is weird to ask but we know that we can convert  NFA TO DFA but is it any procedure to convert DFA to NFA.

Comments

"Every $DFA$ is an $NFA$."

---

yes I know mam, actually in order to solve a que this idea came into my mind and i just posted it. Thanks

Answer 1

every dfa is an nfa.. so if you want the dfa to look like an nfa, u can just remove dead state or dead configurations and unwanted transitions which are not neccessary to satisfy the language rules.

Comments

Thanks, actually I was thinking that like  S.T.T. (NFA to DFA) conversion we have something like that, Now I am ok with the explanation.