nondeterministic finite automaton

A nondeterministic finite automaton is a theoretical computational model consisting of a finite set of states and transitions where, for a given state and input symbol, the machine may move to zero, one, or multiple possible next states (including via ε-moves), accepting an input string if at least one possible path leads to an accepting state.