Marquand's Representation of Boolean Functions
Marquand's Representation of Boolean Functions
This Demonstration shows Marquand's rectangular representation of Boolean functions of two to six arguments.
Acronyms:
CNF = canonical normal form
DNF = disjunctive normal form
BDT = binary decision tree
ANF = algebraic normal form