minDNF {logicFS}R Documentation

Minimum Disjunctive Normal Form

Description

Computes the prime implicants or the minimal disjuntive form, respectively, of a given truth table.

Usage

  prime.implicants(mat)
  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.

Details

minDNF is a fast implementation of the Quine-McCluskey algorithm using matrix algebra. A Tech. Report on this implementation will follow soon.

Value

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.

Author(s)

Holger Schwender, holger.schwender@udo.edu

See Also

logic.pimp


[Package logicFS version 1.2.0 Index]