what is canonical form of boolean expression?
Boolean functions expressed as a sum of minterms or product of maxterms are said to be in canonical form. ... A Boolean function can be expressed algebraically from a given truth table by forming a : minterm for each combination of the variables that produces a 1 in the function and then taking the OR of all those terms.