Synthesis of linear sequential machines

This paper studies the problem of synthesis of linear sequential machines from transition tables which are not necessarily coded and reduced. Two synthesis procedures are presented. One is adopted from linear system theory; the other is a modification of Cohn and Even's method. These two procedures not only are computationally simpler than any existing methods, but also yield minimal canonical form equations