A State Assignment for p‐Valued Sequential Machines
Yasunori Nagata, Chotel Zukeran, Chushin Afuso · Systems and Computers in Japan · 1990
Abstract For p‐valued synchronous sequential machines a new method of state assignment is proposed. In this method, a given sequential machine is expressed by a state transition table and then codes with low Hamming weight are assigned to the internal states with high frequency of appearance. This process yields the state transition functions which express transition to the states with low frequency of appearance, thereby attaining the state transition functions with the minimum number of terms in the principal disjunctive canonical form. All the procedures can be expressed in a simple straightforward algorithm and therefore can be processed fast. Experiments on a computer for p = 3 show that the truth‐table densities of the state transition matrices are about 80 to 90 percent compared with those obtained by the triangle method [1, 2] which is one of the existing methods. The results compare favorably with those obtained by other methods even after simplification by the extended Quine‐McCluskey method.