Assertion: deterministic finite automaton | /r/HasProperty | nfa
Facets:
Source sentences:
text: A nondeterministic finite automaton (NFA), or nondeterministic finite-state machine, does not need to obey these restrictions.
text: In the theory of computation, a generalized nondeterministic finite automaton (GNFA), also known as an expression automaton or a generalized nondeterministic finite state machine, is a variation of a nondeterministic finite automaton (NFA) where each transition is labeled with any regular expression.