finite state machine


Also found in: Acronyms, Encyclopedia, Wikipedia.

finite state machine

n.
A model of a computational system, consisting of a set of states, a set of possible inputs, and a rule to map each state to another state, or to itself, for any of the possible inputs. The computational core of a Turing machine is a finite state machine. Also called finite state automaton.
References in periodicals archive ?
N-structures applied to finite state machines. IAENG International Journal of Applied Mathematics, 43(3)(2013), 233-237.
In the second use case, a designer must choose between two implementations of a finite state machine. Area and power estimates were obtained using PAElib for the two implementations.
A step-by-step method is proposed to translate the cause-effect tables in finite state machines, which are then submitted to formal verification in the UPPAAL model checking tool.
Grimm, "TR-FSM: Transition-based Reconfigurable finite state machine," ACM Transactions on Reconfigurable Technology and Systems (TRETS), vol.
Maldonado, "An assessment of extended finite state machine test selection criteria," The Journal of Systems and Software, vol.
The defined fuzzy finite state machine is depicted in Figure 3, which shows all possible transition paths, health judgment rules, health symptoms, and states graphically.
Abstract finite state machine approach to digital event reconstruction.
First, we can simply list all transitions of a finite state machine (cf.
Each monitor encodes an invariant which is a Boolean condition that must always be true and they can be used to represent both safety properties and bounded-liveness properties that can be reduced to (possibly non-deterministic) finite state machines.
Then finite state machine formation management unit and the solution of reconfiguration problem which is revised in quantum particle swarm optimization algorithm are, respectively, presented in Sections 5 and 6.
San-Yih Hwang, Ee-Peng Lim, Chien-Hsiang Lee, and Cheng Hung Chen propose a model to permit invocation sequences of web services using a finite state machine. Each state of execution is assigned an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each Web service may fail with some probability.
At a low level, finite state machines are relatively simple and easy to understand, as shown above.
Full browser ?