「finite」の共起表現一覧(1語右が「state」)
該当件数 : 30件
A | finite state machine of a process |
finite state automata, pushdown automata, etc.). | |
neration of efficient lexical processors using | finite state techniques". |
it can be accepted by a deterministic | finite state machine. |
The standard way to build a deterministic | finite state machine from a nondeterministic finite s |
he set of all possible sequences executed by a | finite state machine. |
A computer is a | finite state machine that may be viewed as a discrete |
exactly all languages that can be decided by a | finite state automaton. |
g functional programming ideas with ideas from | finite state automata. |
The machine specifications include a | finite state machine that determines the processor's |
Note that the | finite state machine does not have to explicitly spec |
l and processes to be designed as event-driven | finite state machines. |
diagrams can be used to graphically represent | finite state machines. |
An example is a deterministic | finite state machine which is a finite state machine |
The CIP-model is basically a | finite state machine, or more precisely, an extended |
Since a | finite state automaton must eventually return to a pr |
mon deterministic automaton is a deterministic | finite state machine (sometimes referred to as a dete |
This differs from other | finite state machines, which take as input a single s |
hat is, a language that can be recognized by a | finite state automaton. |
An FSMD is a digital system composed of a | finite state machine, which controls the program flow |
d in particular the theory of nondeterministic | finite state machines, it is known that the union of |
morphological parsing is through the use of a | finite state transducer (FST), which inputs words and |
First, Atom designs are always | finite state: all variables are global and declared a |
d, for creating, visualizing, and manipulating | Finite state machines. |
ormally, a tree walking automaton A (TWA) is a | finite state device which walks over the tree in a se |
They have a | finite state control like other automata, but their i |
Kripke structure is a type of nondeterministic | finite state machine proposed by Saul Kripke , used i |
message sequences for one web service using a | finite state automaton FSA over the alphabet of messa |
Whether the automaton in question is a | finite state machine, a pushdown automaton or a full- |
bership of n in the set can be determined by a | finite state automaton on the digits of n in base k. |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると 検索履歴を保存できる! 語彙力診断の実施回数増加! |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると 検索履歴を保存できる! 語彙力診断の実施回数増加! |