Title :
Reduction of the Number of Columns in Flow Table Minimization
Author_Institution :
Visiting Staff Member in the Electronic systems Laboratory, Massachusetts Institute of Technology, Cambridge, Mass.
Abstract :
It is shown that, in minimizing an Incompletely specified flow table, nontrivial column reductions may be considered to obtain a low-cost sequential network. Compatibility classes of columns of a flow table are defined, and other basic concepts for a general approach to the problem are illustrated.
Keywords :
Costs; Turing machines;
Journal_Title :
Electronic Computers, IEEE Transactions on
DOI :
10.1109/PGEC.1966.264573