Register

Canonical Normal Form, Boolean Expression, Minimization

749 views
2 votes
2 votes

Are multiple SOP and POS expressions possible such that they all are unique ?

User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
4 answers
1
Gobind asked Oct 11, 2014
3,462 views
Kindly have a try .... IN canonical POS form following equation is written as (ABC)=AB+BC+AC (A)πM(0,1,2,4) (B)πM(3,5,6,7) (A)πM(0,1,2,3) (A)πM(4,5,6,7)
Kindly have a try .... IN canonical POS form following equation is written asF(A,B,C)=AB+BC+AC (A)πM(0,1,2,4) (B)πM(3,5,6,7)(C)πM(0,1,2,3) (D)πM(4,5,6,7)
User Avatar
1 votes
1 votes
3 answers
2
Utk asked Jan 11, 2016
3,346 views
The boolean expression f(x,y,z) in its canonical form for the decoder circuit shown below is
Note : the bubbles are NOT gates
Note : the bubbles are NOT gates
User Avatar
3 votes
3 votes
3 answers
3
Shefali asked Jul 22, 2015
1,935 views
F = {X -> YZ, Y -> XZ, Z -> X} How many no. of minimal and canonical covers are possible?
Answer is 2 minimal and 2 canonical covers. Please give full explanation of how to solve.
Answer is 2 minimal and 2 canonical covers.Please give full explanation of how to solve.
User Avatar
Link Copied!