Skip to Main Content
This paper presents a unified approach to the synthesis of linear sequential machines with unspecified outputs. The basic tools employed here are the transition graphs and the coset partitions of linear machines. Coset partitions are studied in detail and used to clarify the various synthesis methods using partitions. They are then combined with the transition graphs to form a set of unified synthesis methods which are applicable to any kind of linear machines and very effective even if the number of states is large. Examples are given to illustrate the techniques. A complete set of synthesis methods is also given in the conclusions.
Date of Publication: Feb. 1969