𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time-varying sequential machines

✍ Scribed by Arthur Gill

Publisher
Elsevier Science
Year
1963
Tongue
English
Weight
873 KB
Volume
276
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

tn this paper a model is proposed for time-varying sequential machines, which is essentially a generalized version of the conventional fixed (i.e., time-invariant) sequential machine. It is shown how a time-varying machine can be characterized by means of matrices, and how simple matrix operations can be employed to compute the behavior of the machine at arbitrary times. Equivalence notions are developed which facilitate the comparison of states and machines in the time-varying case. The special class of periodic machines is investigated in detail. A procedure is proposed for establishing the equivalence or nonequivalence of two given periodic machines, tt is shown that every periodic machine has a fixed representation whose minimal form is unique up to isomorphism. Algorithms are formulated for constructing fixed representations for periodic machines and periodic representations for fixed machines. Switching from one representation to another offers greater design flexibility, with the possibility of trading off memory capacity for logical complexity.

πŸ“œ SIMILAR VOLUMES

Time-varying linear sequential machines.
Time-varying linear sequential machines. I
✍ D.R. Deuel πŸ“‚ Article πŸ“… 1969 πŸ› Elsevier Science 🌐 English βš– 846 KB

A time-varying linear sequential machine (TVLSM) model is considered which has the property that the dimensionality of the system is a function of time. General response formulas for TVLSM's are developed and an effective procedure is described for minimizing such systems with respect to dimensional

A polynomial time algorithm to infer seq
A polynomial time algorithm to infer sequential machines
✍ Katsuhiko Takahashi; Akio Fujiyoshi; Takumi Kasai πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 999 KB

## Abstract In this paper, we will describe an algorithm which infers a Moore‐type sequential machine from examples of inputs and outputs of an unknown Moore‐type sequential machine. The hypothesis output by this inference algorithm is a nondeterministic Moore‐type sequential machine which does not

On identification of synchronous sequent
On identification of synchronous sequential machines
✍ C.L. Sheng; S.R. Das πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 436 KB

For a completely specified strongly connected synchronous sequential machine, the problem of constructing the input-output sequences that will be sufficient to identify the machine, given its flow table, is first studied in this paper. An adaptive procedure is suggested, which constructs the identif