1 votes 1 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. Digital Logic isi2017-pcb-cs digital-logic functional-completeness descriptive + – go_editor asked Sep 20, 2018 • edited Nov 8, 2019 by go_editor go_editor 444 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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. smsubham answered Dec 8, 2019 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.