Computes the minimal disjuntive normal form for a given truth table.
a matrix containing only 0's and 1's. Each column of
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.
Holger Schwender, email@example.com
Schwender, H. (2007). Minimization of Boolean Expressions Using Matrix Algebra. Technical Report, SFB 475, Department of Statistics, TU Dortmund University.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.