So I am learning about DFA and NFA, and I need some clarification for it. DFA accept empty settransition for every element in the alphabetpath are deterministic NFA accept the empty set and empty stringpath are not deterministicMy question is does NFA need a transition for every element in the alphabet? If not, then let say the alphabet is {0. 1} and I am at a state without the transition for 1, do I go to the empty state or something? 
What does an NFA do if there's no transition with the correct symbol?
automata;finite automata