Question: why we convert nfa to dfa?
Answer: A non-deterministic finite automaton can have a transition that goes to any number of states for a given input and state. ... The process of converting NFA to DFA eliminates this ambiguity and allows a program to be made (the context here, I assume, is compiler construction). NFA also suffers from combinatorial explosion.