transition function


Also found in: Wikipedia.

transition function

[tran′zish·ən ‚fəŋk·shən]
(computer science)
A function which determines the next state of a sequential machine from the present state and the present input.
References in periodicals archive ?
The proposed blind Turing machine processed over the encrypted text and using a proper encryption of the original transition function in M is done.
G(, c, st) is known as transition function which is continuous and bounded between zero and one depending on the smoothness parameter , location parameter c and transition variable st, which may be an independent variable or a linear combination of the elements of zt.
The surjectivity of the machine is a simple property; it can be directly determined from the transition function of the machine.
it-1]; [gamma], c) is a transition function of the threshold variable [q.
A topological dynamical system is a pair (X, T), where X is a topological space called phase space and T: X [right arrow] X is a continuous map called global transition function (see for example Kurka (2003)).
Note that the transition function is rarely complete: not every event can occur in every state of the system.
The transition function [delta] for a NPDA has the form Q x ([summation] [union]{[lambda]}) x [?
Next, I offer a simple framework that divides modeling into five components: states, actions, exogenous information, the transition function and the objective function.
delta]int: S [right arrow] S: represents the internal transition function that changes the state of the system autonomously.
Thus we obtain an impulse transition function of the system, which is described by the equation (38)
Gonzalez, Terasvirta and van Dijk (2005) went on to develop the panel smooth transition regression (PSTR) model which modifies the original PTR model by including a transition function.

Full browser ?