This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Rule for Reducing CC Tables
November 1970 (vol. 19 no. 11)
pp. 1108-1111
Building on the work of Grasselli and Luccio, a new rule for reducing closure-covering (CC) tables is given and proved. Experience with the use of this new rule on actual problems with computer programs is reported. As an example of the size of problem, one 22-state four-input flow table with 261 prime compatibles and a resulting matrix for the linear integer programming problem of 504 rows and 261 columns was solved on an IBM 7094 in less than three minutes, resulting in a reduced machine with nine states.
Index Terms:
Flow table reduction, incompletely specified sequential machines, linear programming solution of CC tables, reduction of CC tables, state reduction.
Citation:
R.W. House, D.W. Stevens, "A New Rule for Reducing CC Tables," IEEE Transactions on Computers, vol. 19, no. 11, pp. 1108-1111, Nov. 1970, doi:10.1109/T-C.1970.222842
Usage of this product signifies your acceptance of the Terms of Use.