Expresión not((a|not(b))&(not(a)|c))
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$a | \neg b = b \vee \neg a$$
$$\neg a | c = a \vee \neg c$$
$$\left(a | \neg b\right) \wedge \left(\neg a | c\right) = \left(a \wedge b\right) \vee \left(\neg a \wedge \neg c\right)$$
$$\neg \left(\left(a | \neg b\right) \wedge \left(\neg a | c\right)\right) = \left(a \wedge \neg b\right) \vee \left(c \wedge \neg a\right)$$
$$\left(a \wedge \neg b\right) \vee \left(c \wedge \neg a\right)$$
Tabla de verdad
+---+---+---+--------+
| a | b | c | result |
+===+===+===+========+
| 0 | 0 | 0 | 0 |
+---+---+---+--------+
| 0 | 0 | 1 | 1 |
+---+---+---+--------+
| 0 | 1 | 0 | 0 |
+---+---+---+--------+
| 0 | 1 | 1 | 1 |
+---+---+---+--------+
| 1 | 0 | 0 | 1 |
+---+---+---+--------+
| 1 | 0 | 1 | 1 |
+---+---+---+--------+
| 1 | 1 | 0 | 0 |
+---+---+---+--------+
| 1 | 1 | 1 | 0 |
+---+---+---+--------+
$$\left(a \vee c\right) \wedge \left(\neg a \vee \neg b\right)$$
$$\left(a \vee c\right) \wedge \left(a \vee \neg a\right) \wedge \left(c \vee \neg b\right) \wedge \left(\neg a \vee \neg b\right)$$
(a∨c)∧(a∨(¬a))∧(c∨(¬b))∧((¬a)∨(¬b))
Ya está reducido a FND
$$\left(a \wedge \neg b\right) \vee \left(c \wedge \neg a\right)$$
$$\left(a \wedge \neg b\right) \vee \left(c \wedge \neg a\right)$$