Non-Deterministic Finite Automata (NFA)

Home > Languages > Formal Language > Finite Automata > Non-Deterministic Finite Automata (NFA)

It is a type of finite automata in which for each input symbol, there can be multiple transitions leading to new states.