Home > Term: nondeterministic finite state machine (NFA)
nondeterministic finite state machine (NFA)
A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states. The transition function also may map the null symbol (no input symbol needed) and states to next states.
- Part of Speech: noun
- Industry/Domain: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Creator
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
