Fast State Minimization of Incompletely Specified Sequential Machines
P.K. Gupta, Donald L. Dietmeyer · IEEE Transactions on Computers · 1973
Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum cover with significantly less computation. The factor by which computation is reduced is directly proportional to the complexity of the machine.