Question: can dfa be converted to nfa?
Answer: Simply put, yes. The easiest way to demonstrate that any DFA can be converted into an NFA that recognizes the same language as that DFA follows. Consider an arbitrary DFA D; then, add a nondeterministic transition from any state of D to itself; doing so will flourish that DFA into an NFA.