On the Reduction of Superfluous States in a Sequential Machine
Journal of the ACM (JACM)
State Minimization of Incompletely Specified Sequential Machines
IEEE Transactions on Computers
Sequential Machine Identification
IEEE Transactions on Computers
Minimization of Incompletely Specified Sequential Machines
IEEE Transactions on Computers
Closure Partition Method for Minimizing Incomplete Sequential Machines
IEEE Transactions on Computers
| Hi-index | 14.99 |
This paper describes a new method for the state minimization of incompletely specified sequential machines. Previously described methods start with generating all maximal compatibles of states of the original incompletely specified machine and then try to find a closed cover which consists of a minimal number of MCs or portions of MCs. This process involves a long enumeration process and, as the number of states grows, turns out to be impractical for hand calculation.