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 ?
One of the main motivations of using SageMath as the home for this finite state machine module was to allow the use of more or less everything in the zoo of mathematical objects available in SageMath, in particular during the construction and manipulation of automata and transducers.
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.
TABLE 1: The state transition function a for the finite state machine in Figure 3.
1: [8]A fuzzy finite state machine is a triple M = (Q x X x Q),where Q and X are finite nonempty sets and p is a membership of some fuzzy subsets of Q x X x Q, i.
The finite state machine which is responsible for decision making can be described as follows: the system stays in the idle mode if the attention level is below the threshold regardless of the muscle state.
In the general morphological analyzer consists of Finite State Transducer, Finite State Machine u Controller (fig.
In case of steady pace calculating, which was assumed at the beginning, the necessity of controlling finite state machine is eliminated, so that the control is achieved by directly using the tact pulse sequence.
Keywords: branch predictor, bimodal, finite state machine, SDFSM, SPEC2000, saturated counter, SimpleScalar
Full browser ?