「Nondeterministic」の共起表現一覧(1語右で並び替え)
該当件数 : 19件
| d to create the background against which | non-deterministic and probabilistic reasoning can be perfo |
| Since a random node is updated ARBNs are | non-deterministic and does not have the cycle attractors f |
| As the engine of the Q-systems is highly | non-deterministic, and the manipulated data structures are |
| nce and automata theory, determinizing a | non-deterministic automaton is a very important procedure. |
| rnatively, one can determinize the given | non-deterministic automaton and then, for each instant of |
| This procedure accepts a | non-deterministic automaton of some type and returns anoth |
| given word if it is accepted by a given | non-deterministic automaton then one have to check every p |
| cluding the problems of interleaving and | non-deterministic choice with regards to refinement in pro |
| The | non-deterministic features include an Earley parser genera |
| m tells that any AFA is equivalent to an | non-deterministic finite automaton (NFA) by performing a s |
| lyzers (parsers) (both deterministic and | non-deterministic) for all kind of context-free grammars ( |
| be reached from u within one step of the | non-deterministic machine. |
| into account stochasticity, which is the | non-deterministic or random processes in nature. |
| he languages that can be recognized by a | non-deterministic pushdown automaton. |
| own automaton (although they are for the | non-deterministic pushdown automaton). |
| ntext-free language can be accepted by a | non-deterministic pushdown automaton. |
| an alternating Turing machine (ATM) is a | non-deterministic Turing machine (NTM) with a rule for acc |
| e problem can be shown to be in NL, as a | non-deterministic Turing machine can guess the next node o |
| ion of string acceptance is unchanged: a | non-deterministic Turing machine accepts a string if, when |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
