论文信息 - State Minimization of Incompletely Specified Sequential Machines

State Minimization of Incompletely Specified Sequential Machines

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.

Jehuda Kella

[1] G. Waldbaum,et al. A Note on State Minimization of Asynchronous Sequential Functions , 1967, IEEE Trans. Electron. Comput..

[2] Seymour Ginsburg,et al. On the Reduction of Superfluous States in a Sequential Machine , 1959, JACM.

[3] Edward J. McCluskey. Minimum-state sequential circuits for a restricted class of incompletely specified flow tables , 1962 .

[4] William S. Meisel. A Note on Internal State Minimization in Incompletely Specified Sequential Networks , 1967, IEEE Trans. Electron. Comput..

[5] Fabrizio Luccio,et al. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..

[6] 고경식. 불완전하게 규제된 순서회로의 내부상태의 단위화방법 ( A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks ) , 1967 .

[7] Stephen H. Unger. Flow Table Simplification-Some Useful Aids , 1965, IEEE Trans. Electron. Comput..

[8] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..