minDNF {logicFS} | R Documentation |
Computes the prime implicants or the minimal disjuntive form, respectively, of a given truth table.
prime.implicants(mat) minDNF(mat)
mat |
a matrix containing only 0's and 1's. Each column of mat
corresponds to a binary variable and each row to a combination of the
variables for which the logic expression is TRUE. |
minDNF
is a fast implementation of the Quine-McCluskey algorithm using matrix
algebra. A Tech. Report on this implementation will follow soon.
Either an object of class minDNF
or of class primeImp
. Both contain
a vector of (a minimum number of) prime implicants. The primeImp
additionally
contains the prime implicant table.
Holger Schwender, holger.schwender@udo.edu