Question: Question about Boolean Formulas. a) Create all BF({X1,X2}, {NOR}) with parse trees that have a height of at most 1 (do not distinguish between different
Question about Boolean Formulas.
a) Create all BF({X1,X2}, {NOR}) with parse trees that have a height of at most 1 (do not distinguish between different orders of leaves).
b) How many different Boolean functions are there with two variables?
c) Group the Boolean formulas from a) into groups that are interpreted as the same Boolean function. How many different functions from b) cannot be represented by the formulas from a)?
d) How many functions can be represented with a formula with U = {X3, X2, X1} that are both a SOP and a POS? Write all of them down.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
