「finite」の共起表現一覧(1語右が「automaton.」)
該当件数 : 13件
| it can be accepted by an alternating | finite automaton |
| n is an algorithm to construct a deterministic | finite automaton from a given nondeterministic finite |
| In automata theory, an alternating | finite automaton (AFA) is a nondeterministic finite a |
| ministic tree automaton as same as alternating | finite automaton extends nondeterministic finite auto |
| ndard method for converting a nondeterministic | finite automaton (NFA) into a deterministic finite au |
| ced a method for decomposing a (deterministic) | finite automaton into "simple" components that are th |
| any AFA is equivalent to an non-deterministic | finite automaton (NFA) by performing a similar kind o |
| number of states in the minimum deterministic | finite automaton Aβ* to recognize language β*. |
| e (or states in the case of a nondeterministic | finite automaton) a finite semiautomaton or finite st |
| regular language Lq,q' that is accepted by the | finite automaton (Q,Σ,Δ,{q},{q'}). |
| In automata theory, a nondeterministic | finite automaton with ε-moves (ε-NFA) is defined as a |
| automata theory, a nested stack automaton is a | finite automaton that can make use of a stack contain |
| ng of digraph properties of a nondeterministic | finite automaton A with state set Q, we naturally add |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
