in Digital Logic edited by
321 views
0 votes
0 votes
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.
in Digital Logic edited by
321 views

1 Answer

0 votes
0 votes
We have $1$ and $AB'$.

$F(A,B) = AB'$

$F(1,B) = 1.B' = B.$

$F(A,B') = A.(B')' = AB$

We can $ [*,’]$ so its functionally complete.

Related questions