Two-Comparable Prime Implicants and Canonical Switching Functions.
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
This paper shows that by using a special partial ordering on binary vectors, the set of prime implicants of a canonical two-comparable switching function can be easily reduced to a set of two-comparable prime implicants that imply under the two-comparability the deleted prime implicants. A rudimentary algorithm is presented for actually accomplishing this reduction. Author
- Theoretical Mathematics