- 不確定的有窮自動(dòng)機(jī)
- 不確定性有限自動(dòng)機(jī)
"查查詞典"手機(jī)版
千萬(wàn)人都在用的超大詞匯詞典翻譯APP
In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite state machine where from each state and a given input symbol the automaton may jump into several possible next states. This distinguishes it from the deterministic finite automaton (DFA), where the next possible state is uniquely determined.
詳細(xì)百科解釋