Computes the minimal disjuntive normal form for a given truth table.
Usage
minDNF(mat)
Arguments
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.
Value
An object of class minDNF containing a vector comprising a minimized set of prime implicants. If more than
one solution exist, then a list is returned containing all solutions.
Schwender, H. (2007). Minimization of Boolean Expressions Using Matrix Algebra.
Technical Report, SFB 475, Department of Statistics, TU Dortmund University.