Fast heuristic algorithms for finite state machine minimization

A technique for the minimization of completely and incompletely specified sequential machines is described. By employing fast heuristic algorithms, it is shown that it is possible to effectively reduce large (121 states) finite state machines in reasonable computing time when compared to other metho...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the European Conference on Design Automation pp. 192 - 196
Main Authors Kannan, L.N., Sarma, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1991
Subjects
Automata
Computer science
Heuristic algorithms
Inspection
Logic
Minimization methods
Polynomials
Testing
Online AccessGet full text

Cover

More Information
Summary:A technique for the minimization of completely and incompletely specified sequential machines is described. By employing fast heuristic algorithms, it is shown that it is possible to effectively reduce large (121 states) finite state machines in reasonable computing time when compared to other methods. It has been shown that it is possible to achieve area/literal reductions in the range of 30-100% over unreduced machines using this technique.< >
DOI:10.1109/EDAC.1991.206388