sequential machine

sequential machine

[si′kwen·chəl mə′shēn]
(computer science)
A mathematical model of a certain type of sequential circuit, which has inputs and outputs that can each take on any value from a finite set and are of interest only at certain instants of time, and in which the output depends on previous inputs as well as the concurrent input.
References in periodicals archive ?
Initializability consideration in sequential machine synthesis // IEEE Trans.
We next describe a sequential machine that can be in one of a finite number of states, receive one of a finite number of inputs, and emit one of a finite number of outputs.
Definition: Sequential machine: SM = ([X.sub.0], Q, [Delta], [q.sub.0], [Gamma], [Beta])
If we accept the sequential computation thesis, which states that time on all "reasonable" sequential machine models is related by a polynomial [11], then the no-tape RAM is an unreasonably strong model of computation, at least when it comes to sublinear algorithms.
My intent here is that a reasonable algorithm be used on the sequential machine. For example, if a major part of the time for the job is taken in a symmetric eigenvalue routine, the parallel machine might run fastest with a Jacobi iteration.
The text has been designed to be used in a two semester sequence, with chapters on number systems and codes; switching algebra and its applications; minimization of switching functions; logic design; multi-level logic synthesis; threshold logic for nanotechnologies; testing of combinational circuits; synchronous sequential circuits and iterative networks; capabilities, minimization, and transformation of sequential machines; memory, definiteness, and information losslessness of finite automata; linear sequence machines; and finite-state recognizers serving a second semester on finite automata theory.
I see this grand goal of making parallel programming an attractive option for sequential machines as important for the following reasons:
In this regard, I dare say that in the end and in line with the above definition of complexity, it might eventually be found that the theory of sequential machines with integral transform encoding and decoding maps is the most promising avenue.
Today, supercomputers are becoming standard fare in systems design, problem solving, neural networks and scores of defense applications where their blinding speed can offer solutions to complex problems in just 30 minutes, compared to 24 hours or longer with traditional sequential machines.
He then works through an analysis of synchronous sequential machines including sequential circuits and methods of analysis, the synthesis of synchronous sequential machines, including Moore and Mealy machines, analysis of asynchronous sequential machines, synthesis of asynchronous sequential machines, and pulse-mode asynchronous sequential machines.
The audience for high-performance computing is not the computer science community, but scientists, engineers, and other technical programmers whose computational requirements exceed the capacities of even our fastest sequential machines. They have turned to parallel processing because their problems are too big, or their time constraints too pressing, for conventional architectures.
Since computers are either individual sequential machines or collections of sequential machines, it seems unrealistic to attempt to eliminate procedurality entirely.

Full browser ?