A method is illustrated for minimizing the number of internal states in incompletely specified sequential networks. The minimization algorithm applies to any type of incompletely specified flow table. It is shown that only some compatibility classes (prime compatibility classes) need be considered as members of a solution. The selection of prime classes may be obtained as the solution of an integer linear program or by tabular techniques that are an extension of those used in the selection of prime implicants.
No takes yet. Share an insight, caveat, or question.
Grasselli et al. (1965) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: