ゆうげん
有限オートマトン
1. finite automatonComputing
2. Finite-state machineA finite-state machine (FSM) or finite-state automaton, or simply a state machine, is a mathematical model used to design computer programs and digital logic circuits. It is conceived as an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time; the state it is in at any given time is called the current state. It can change from one state to another when initiated by a triggering event or condition, this is called a transition.
Read “Finite-state machine” on English Wikipedia
Read “有限オートマトン” on Japanese Wikipedia
Read “Finite-state machine” on DBpedia
Read “Finite-state machine” on English Wikipedia
Read “有限オートマトン” on Japanese Wikipedia
Read “Finite-state machine” on DBpedia
Discussions
Log in to talk about this word.