PPT
Nondeterministic Finite Automata. Hopcroft, Motawi, Ullman, Chap 2. NFAs: Nondeterministic Finite Automata. Same as a DFA, except: On input a, state q may have more than one transition out, implying the possibility of multiple choices when processing an input symbol