翻訳と辞書 
finite state machine ： FOLDOC  Finite State Machine (FSM or "Finite State Automaton", "transducer") An abstract machine consisting of a set of {states} (including the initial state), a set of input events, a set of output events, and a state transition function. The function takes the current state and an input event and returns the new set of output events and the next state. Some states may be designated as "terminal states". The state machine can also be viewed as a function which maps an ordered sequence of input events into a corresponding sequence of (sets of) output events. A deterministic FSM (DFA) is one where the next state is uniquely determinied by a single input event. The next state of a nondeterministic FSM (NFA) depends not only on the current input event, but also on an arbitrary number of subsequent input events. Until these subsequent events occur it is not possible to determine which state the machine is in. It is possible to automatically translate any nondetermi
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース 
Copyright(C) kotoba.ne.jp 19972016. All Rights Reserved.

