The document describes converting functions into NAND and NOR gates. For a function F(s) with inputs a, b, and c, the document shows how to rewrite the function using only NAND gates by factorizing terms like (ab) + (bc) + (ac) into ((ba) · bc · (ac)). Similarly, it rewrites the function using only NOR gates by factorizing terms like ab + bc + ac into b + (a + c) + (a + c).

1. Conversió de funcions en portes NAND o NOR
NAND
F(s) = (ab) + (bc) + (ac)
F(s)= b (a + c) + (ac)
F(s)= (b · (a + c) + (ac))
F(s)= (b(a + c) · (ac))
F(s)= ((ba + bc)· (ac))
F(s)= ((ba) · bc · (ac))
NOR
F(s) = ab + bc + ac
F(s) = b(a + c) + ac
F(s) = b + (a + c) + ac
F(s) = b + (a + c) + (ac)
F(s) = b + (a + c) + (a + c)