Recent questions tagged boolean-functions

The simplified form of the Boolean function $\mathrm{F}(W, X, Y, Z)=\Sigma(4,5,10,11,12,13$, $14,15)$ with the minimum number of terms and smallest number of literals in ...

$A= a_{1}a_{0}$ and $B= b_{1}b_{0}$ are two $2$–bit unsigned binary numbers. If $F(a_{1},a_{0},b_{1},b_{0})$ is a Boolean function such that $F=1$ only when $A>B,$ and $F...

Boolean function $\text{F}$ of three variable $\text{X, Y,}$ and $\text{Z}$ is given as$F\left ( X, Y, Z \right )=\left ( {X}' + Y + Z \right )\cdot \left ( X + {Y}' + {Z...

Given $f(A,B,C,D)=\sum m(0,1,2,6,8,9,10,11)+\sum d(3,7,14,15)$ is a Boolean function, where m represents min-terms and d represents don’t-cares. The minimal sum of produc...

The total number of Boolean functions with distinct truth-tables that can be defined over 3 Boolean variables is $\_\_\_\_$.

$X=X_1X_0 \;and\;Y=Y_1Y_0$ are 2-bit binary numbers. The Boolean function $S$ that satisfies the condition “If $X>Y$, then $S=1”$, in its minimized form, is$X_1Y_1+X_0Y_0...