Minimum-state sequential circuits for a restricted class of incompletely specified flow tables

This paper is concerned with the problem of obtaining minimum-state sequential circuits for incompletely specified flow tables. Attention is directed to relay-type flow tables in which the only unspecified entries are those which occur because of restrictions on the allowed input-variable changes. For this type of flow table it is shown that a simplified version of the Unger-Paull procedure is sufficient. In particular, only maximum compatibles need be considered in forming the minimum-state sequential circuit.