What is canonical form of Boolean expression? Mention the types of canonical expression?
Answers
Answer:
Canonical forms express all binary variables in every product (AND) or sum (OR) term of the Boolean function. There are two types of canonical forms of a Boolean expression. The first one is called sum of products or “SoP“ and the second one is called product of sums or “PoS”.
Explanation:
would you like my answer
Answer:
The canonical forms of any Boolean expression are "sum of min terms" and "product of max terms". The term "sum of products" (SoP or SOP) is widely used for the canonical form, which is a disjunction of mint terms (OR). Its De Morgan dual is the "product of sums" (PoS or POS) canonical form, which is the relation of maxterms (AND). These forms can be useful for simplifying these functions, which is very important in the optimization of Boolean formulas in general and in the optimization of digital circuits in particular.
Boolean functions expressed as a sum of minterms or a product of maxterms are in canonical form. Standard Form - A Boolean variable can be expressed in either real or augmented form.
There are two types of canonical forms:SOP sum of products and (POS) products or disjunctive normal forms or Conjunctive normal forms.
Boolean expression related two more questions:
https://brainly.in/question/43182224
https://brainly.in/question/34491665
#SPJ3