Minimal Closed Partitions for Incompletely Specified Flow Tables

1 April 1966

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers

Vol. EC-15 (2) , 245-249
https://doi.org/10.1109/PGEC.1966.264308

Abstract

In this paper, an algorithm is presented to find a minimal closed partition of the set of internal states of an incompletely specified flow table. The minimal partition is obtained by solving an integer linear program.

Keywords

This publication has 4 references indexed in Scilit:

A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
IEEE Transactions on Electronic Computers, 1965
On the State Assignment Problem for Sequential Machines. I
IEEE Transactions on Electronic Computers, 1961
Integer Programming and Pricing
Econometrica, 1960
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
IEEE Transactions on Electronic Computers, 1959