In Boolean logic, a formula for a Boolean function f is in Blake canonical form (BCF), also called the complete sum of prime implicants, the complete sum, or the disjunctive prime form, when it is a disjunction of all the prime implicants of f. == Relation to other forms == The Blake canonical form is a special case of disjunctive normal form.
In Boolean logic, a formula for a Boolean function f is in Blake canonical form (BCF), also called the complete sum of prime implicants, the complete sum, or the disjunctive prime form, when it is a disjunction of all the prime implicants of f. == Relation to other forms == The Blake canonical form is a special case of disjunctive normal form.
Source: Wikipedia "Blake canonical form" · CC BY-SA 4.0
Share this article: X · Bluesky