Question: give an algorithm for constructing sum of products representation for an arbitrary logic equation consisting AND, OR, NOT. It should be recursive and should not

give an algorithm for constructing sum of products representation for an arbitrary logic equation consisting AND, OR, NOT. It should be recursive and should not construct truth table in the process

eg OR terms equation can be E = (A.B.C') + (A.C.B') + (B.C.A')

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!