首页 > Term: nondeterministic finite automaton
nondeterministic finite automaton
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.
0
创建者
- GeorgeV
- 100% positive feedback