Representation of Boolean Functions Using Binary Trees
Representation of Boolean Functions Using Binary Trees
This Demonstration shows representations of Boolean functions of two, three or four arguments using binary trees.
Abbreviations: CNF = canonical normal form, DNF = disjunctive normal form, BDT = binary decision tree, ANF = algebraic normal form, BFF = Boolean function form.