A Note on Internal State Minimization in Incompletely Specified Sequential Networks
- 1 August 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-16 (4) , 508-509
- https://doi.org/10.1109/pgec.1967.264674
Abstract
A step in state minimization requires the selection of a minimal class of compatible sets of internal states which covers the given machine and is closed. Grasselli and Luccio have presented a solution of this problem which has certain drawbacks. This paper presents a simpler and shorter algorithm, guaranteed to yield all solutions, based upon their work and that of Paull and Unger.Keywords
This publication has 2 references indexed in Scilit:
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959