Fast H eur is t i c A lgo 1- i t him for Fi iii t e Stat e h/z achi ne I/I iiii i n i z at i oil
L. N. Kannan, D. Sarma · 1991
In this paper, a technique for the minimization of completely and incompletely specified sequential machines is described. By employing fast heuristic algorithms, it has been shown that it is possible to effectively reduce large (121 states) finite date nia.chines in reasonable computing time when compared t.o ot.her methods. It has been shown that. it is possible t.0 achieve area/literal reductions in the range of 30-100% over unreduced machines using this technique.