Accession Number : AD0648558

Title :   ON THE REALIZABILITY OF QUASI-LINEAR SEQUENTIAL MACHINES,

Corporate Author : ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB

Personal Author(s) : Chang, Szu-Chi

Report Date : FEB 1967

Pagination or Media Count : 71

Abstract : The realizability of quasi-linear sequential machines is studied in this thesis. For a given coding of the states of a sequential machine, a set of linear relations among the states can be found. A quasi-linear sequential machine preserves these linear relations under state transitions. A necessary and sufficient condition is first established for a completely specified coded sequential machine to have a quasi-linear realization with a minimum number of state variables. The theorem is then extended to uncoded sequential machines and involves obtaining, by an iterative method, a linear relation among the states and from this relation the generation of others until a number of linear relations sufficient to specify a state assignment has been obtained. A graphical representation of the theorem and an algorithm to synthesize an uncoded completely specified quasi-linear sequential machine from the flow table description are developed. (Author)

Descriptors :   *AUTOMATA, SYNTHESIS, GRAPHICS, TOPOLOGY, ALGORITHMS, ALGEBRA, THEOREMS, SET THEORY, MATHEMATICAL LOGIC, LINEAR SYSTEMS.

Subject Categories : Computer Hardware
      Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE