minDNF: Minimum Disjunctive Normal Form
In mcbiopi: Matrix Computation Based Identification of Prime Implicants

Description Usage Arguments Value Author(s) References See Also Examples

View source: R/minDNF.R

Computes the minimal disjuntive normal form for a given truth table.

1	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.

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, holger.schwender@hhu.de

Schwender, H. (2007). Minimization of Boolean Expressions Using Matrix Algebra. Technical Report, SFB 475, Department of Statistics, TU Dortmund University.

prime.implicants

## Not run: 
# Generate the truth table considered in Schwender (2007).

mat <- matrix(c(rep(0, 4), rep(1, 6), 
   rep(0, 6), rep(1, 4),
   0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 
   0, 1, 0, 1, 1, 1, 0, 1, 0, 1), ncol=4)
colnames(mat) <- paste("X", 1:4, sep="")

# Computing the minimal disjunctive normal form.

minDNF(mat)

## End(Not run)