NFA (Non-Deterministic Finite Automaton) can have multiple transitions for the same input, whereas DFA (Deterministic Finite Automaton) has exactly one transition for each input.
Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.Brink van der MerweHellis TammLynette van ZijlDescriptional complexity of formal systems: 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings...