This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Further Reduction of CC-Tables
April 1971 (vol. 20 no. 4)
pp. 454-456
ASCII Text
x 
 
H.A. Curtis, "The Further Reduction of CC-Tables," IEEE Transactions on Computers, vol. 20, no. 4, pp. 454-456, April, 1971.
 
 
BibTex
x
 
@article{ 10.1109/T-C.1971.223264,
author = {H.A. Curtis},
title = {The Further Reduction of CC-Tables},
journal ={IEEE Transactions on Computers},
volume = {20},
number = {4},
issn = {0018-9340},
year = {1971},
pages = {454-456},
doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223264},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - The Further Reduction of CC-Tables
IS - 4
SN - 0018-9340
SP454
EP456
EPD - 454-456
A1 - H.A. Curtis,
PY - 1971
KW - Covering and closure tables
KW - incompletely specified sequential machines
KW - minimization of internal states
KW - reduction algorithm
KW - reduction rules.
VL - 20
JA - IEEE Transactions on Computers
ER -
 
Paull and Unger [1] were the first to develop methods for solving the problem of minimizing the number of internal states of incompletely specified sequential machines. Grasselli and Luccio [2] improved upon these methods by introducing rules for reducing the size of the problem and by transforming the problem into a linear integer programming problem. House and Stevens [3] have provided a means of further reducing the size of the problem by developing an additional rule.
Index Terms:
Covering and closure tables, incompletely specified sequential machines, minimization of internal states, reduction algorithm, reduction rules.
Citation:
H.A. Curtis, "The Further Reduction of CC-Tables," IEEE Transactions on Computers, vol. 20, no. 4, pp. 454-456, April 1971, doi:10.1109/T-C.1971.223264
Usage of this product signifies your acceptance of the Terms of Use.