A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
- 1 June 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (3), 350-359
- https://doi.org/10.1109/pgec.1965.264140
Abstract
A method is illustrated for minimizing the number of internal states in incompletely specified sequential networks. The minimization algorithm applies to any type of incompletely specified flow table. It is shown that only some compatibility classes (prime compatibility classes) need be considered as members of a solution. The selection of prime classes may be obtained as the solution of an integer linear program or by tabular techniques that are an extension of those used in the selection of prime implicants.Keywords
This publication has 5 references indexed in Scilit:
- Minimum-State Sequential Circuits for a Restricted Class of Incompletely Specified Flow Tables*Bell System Technical Journal, 1962
- Minimizing Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1961
- Integer Programming and PricingEconometrica, 1960
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959
- Minimization of Boolean Functions*Bell System Technical Journal, 1956