DocumentCode
1108191
Title
The Further Reduction of CC-Tables
Author
Curtis, H.Allen
Issue
4
fYear
1971
fDate
4/1/1971 12:00:00 AM
Firstpage
454
Lastpage
456
Abstract
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.
Keywords
Covering and closure tables, incompletely specified sequential machines, minimization of internal states, reduction algorithm, reduction rules.; Boolean functions; Circuit synthesis; Equations; Flip-flops; Linear programming; Minimization methods; Covering and closure tables, incompletely specified sequential machines, minimization of internal states, reduction algorithm, reduction rules.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223264
Filename
1671857
Link To Document