Draw the circuit to implement the function $F = \overline{\overline{A \cdot B} + \overline{A \cdot C}}$ Simplify this function and hence redraw the reduced circuit.
Aakash Om Trivedi, AIR 73, 2025
$F = \overline{\overline{A \cdot B} + \overline{A \cdot C}}$
Using NAND NOR gates
Simplifying,
$\overline{A \cdot B} = \bar{A} + \bar{B}$ (Using De-Morgan: $\overline{A \cap B} = \bar{A} \cup \bar{B}$)
$\overline{A \cdot C} = \bar{A} + \bar{C}$
$\therefore F = \overline{\bar{A} + \bar{B} + \bar{A} + \bar{C}}$
$\therefore F = \overline{\bar{A} + \bar{B} + \bar{C}}$ (Using $2A = A$)
$= \overline{\bar{A}} \cdot \overline{\bar{B}} \cdot \overline{\bar{C}}$ (Using De-Morgan)
$= A \cdot B \cdot C$
Reduced circuit
verify using truth-table
| $A$ | $B$ | $C$ | $\overline{A \cdot B}$ | $\overline{AC}$ | $R$ | |---|---|---|---|---|---| | 0 | 0 | 0 | 1 | 1 | 0 | | 0 | 0 | 1 | 1 | 1 | 0 | | 0 | 1 | 0 | 1 | 1 | 0 | | 0 | 1 | 1 | 1 | 1 | 0 | | 1 | 0 | 0 | 1 | 1 | 0 | | 1 | 0 | 1 | 1 | 0 | 0 | | 1 | 1 | 0 | 0 | 1 | 0 | | 1 | 1 | 1 | 0 | 0 | 1 |
Same as $ABC$