Nondeterministic finite automaton
= Nondeterministic finite automaton
{wiki}
= NFA
{c}
{synonym}
A nondeterministic finite automaton assigns a set of possible successor states to each state-symbol pair and accepts when at least one run ends in a final state.