An Efficient Algorithm to Search for Minimal Closed in Incompletely Specified Finite Sequential Machines
Zhenyi Liu · Journal of Sichuan University · 2007
It is very important for circuit complexity by state reduction in finite state machine(FSM)synthesis.Be- cause of EDA development,it needs an efficient algorithm for very large FSM.The good algorithm has been found for completely specified FSM,but it is difficult for incompletely specified FSM.This paper gives an efficient algo- rithm for state minimization of incompletely specified finite state machine.The algorithm utilizes generating se- quence,dynamically constructing searching-tree,pruning,heuristically depth-first searching,and branch bounding methods to reduce the search space and raise speed.