Issue No. 02 - February (1973 vol. 22)
P.K. Gupta , Department of Electrical Engineering, University of Wisconsin
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.
Closed set, closure condition table, compatibility class, cover chart, state minimization.
D. Dietmeyer and P. Gupta, "Fast State Minimization of Incompletely Specified Sequential Machines," in IEEE Transactions on Computers, vol. 22, no. , pp. 215-217, 1973.