Minimizing the Number of States in a Sequential Machine with Don't Care Conditions
Naoki Yamabe Associate, Kenichi Taniguchi, Tadao Kasami · Journal of Cybernetics · 1971
Paull and Unger [1] considered the problem of minimizing the number of states in a sequential machine in which some next-states and/or outputs are unspecified and its initial state is unspecified. This note treats the problem where the initial state of the sequential machine is specified. In this case, the condition for covering the machine is weaker and the problem is more complicated. It is shown, however, that one can treat the problem similarly.