Nondeterministic finite automata (NFA)

Home > Languages > Formal Language > Finite Automata > Nondeterministic finite automata (NFA)

NFAs differ from DFAs in that they can have multiple possible states for a given input, creating a branching path.