TIME-VARYING SEQUENTIAL MACHINES
CALIFORNIA UNIV BERKELEY ELECTRONICS RESEARCH LAB
Pagination or Media Count:
A model is proposed for time-varying sequential machines, which is essentially a generalized version of the conventional fixed sequential machine. 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 is shown. 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. It 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 fr periodic machines and periodic representations for fixed machines.
- Computer Hardware