An Adaptation of the Balas Additive Algorithm to the Solution of CC Tables.
Abstract
The Covering Closure (CC) table is used as a tool in minimizing the number of internal states in an incompletely specified sequential machine. The CC table represents a highly specialized system of linear inequalities; each variable in the system may take on only the values 0 or 1, the coefficient of each variable is 0,1, or -1. The algorithm presented in the thesis determines the minimum number of variables which must be set equal to 1 in order that all the inequalities are satisfied. The variables represent sets of internal states of the original machine and hence a minimum state machine is obtained. A computer program to implement the techniques is included. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1970
- Accession Number
- AD0874274
Entities
People
- John M. Mage
Organizations
- Air Force Institute of Technology