Optimizing the Assignment Problem in the Synthesis of Sequential Machines

摘要

A procedure for assigning binary codes to the inputs of a sequential machine is examined in an attempt to mechanize the procedure using linear programming. Reasons are given for the difficulty involved in attempting to derive linear constraining equations for an objective function specified by the procedure. In the second part of this thesis, the partition-pair on the set of states of a sequential machine is extended to the inputs of a sequential machine in an effort to simplify the logical equations. It is shown that input-state pairs are effective in obtaining the simplification of these logical equations. (Author)