Non-deterministic finite automata (NFA)
Home
>
Languages
>
Formal Language
>
Regular Languages
>
Non-deterministic finite automata (NFA)
A finite automaton that can transition to multiple states for a single input symbol.