funciones booleanas1
DESCRIPTION
FUNCIONES CIRCUITOS DOGITALESTRANSCRIPT
FUNCIONES BOOLEANAS
1. F = A + Ba. F(0,0) = 0 + 0 = 0b. F(0,1) = 0 + 1 = 1c. F(1,0) = 1 + 0 = 1d. F(1,1) = 1 + 1 = 1
2. F = A + a. F(0,0) = 0 + = 0 + 1 = 1b. F(0,1) = 0 + = 0 + 0 = 0c. F(1,0) = 1 + = 1 + 1 = 1d. F(1,1) = 1 + = 1 + 0 = 1
3. F = .B+Ca. F(0,0,0) = . 0 + 0 = 1.0 + 0 = 0b. F(0,0,1) = . 0 + 1 = 1.0 + 1 = 1c. F(0,1,0) = . 1 + 0 = 1.1 + 0 = 1d. F(0,1,1) = . 1 + 1 = 1.1 + 1 = 1e. F(1,0,0) = . 0 + 0 = 0.0 + 0 = 0f. F(1,0,1) = . 0 + 1 = 0.0 + 1 = 1g. F(1,1,0) = . 1 + 0 = 0.1 + 0 = 0h. F(1,1,1) = . 1 + 1 = 0.1 + 1 = 1
4. F = A + A BF
0 00 11 01 11011
5. G = A.B + .BA BF
0 00 11 01 10101
TABLA 1PRIMERA FORMA CANONICAF = B+ABSEGUNDA FORMA CANONICAF = (A+B).(+B)TABLA 2PRIMERA FORMA CANONICAF = + C+ BC+A CSEGUNDA FORMA CANONICAF = (A++ C)( + B + C)( + C)()