DocumentCode :
1103981
Title :
A New Rule for Reducing CC Tables
Author :
House, R.W. ; Stevens, D.W.
Author_Institution :
IEEE
Issue :
11
fYear :
1970
Firstpage :
1108
Lastpage :
1111
Abstract :
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.
Keywords :
Flow table reduction, incompletely specified sequential machines, linear programming solution of CC tables, reduction of CC tables, state reduction.; Automata; Laboratories; Linear programming; Telephony; Flow table reduction, incompletely specified sequential machines, linear programming solution of CC tables, reduction of CC tables, state reduction.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1970.222842
Filename :
1671435
Link To Document :
بازگشت