|
A
|
B
|
A>B
|
|
A=B
|
|
A<B
|
|
|
0
|
0
|
0
|
MAX=A+B
|
1
|
Min=NoA*NoB
|
0
|
MAX=A+B
|
|
0
|
1
|
0
|
MAX=A+NoB
|
0
|
MAX=A+NoB
|
1
|
Min=NoA*B
|
|
1
|
0
|
1
|
Min=A*NoB
|
0
|
MAX=NoA+B
|
0
|
MAX=NoA+B
|
|
1
|
1
|
0
|
MAX=NoA+NoB
|
1
|
Min=A*B
|
0
|
MAX=NoA+NoB
|
a) NAND
PARA A=B
|
A
|
B
|
NoA
|
NoB
|
No(A*B)
|
No(NoA*NoB)
|
F=No[No(A*B)*No(NoA*NoB)]
|
|
0
|
0
|
1
|
1
|
1
|
0
|
1
|
|
0
|
1
|
1
|
0
|
1
|
1
|
0
|
|
1
|
0
|
0
|
1
|
1
|
1
|
0
|
|
1
|
1
|
0
|
0
|
0
|
1
|
1
|
PARA A>B
|
A
|
B
|
NoB
|
F=No[No(A*NoB)]
|
|
0
|
0
|
1
|
0
|
|
0
|
1
|
0
|
0
|
|
1
|
0
|
1
|
1
|
|
1
|
1
|
0
|
0
|
PARA A<B
|
A
|
B
|
NoA
|
F=No[No(NoA*B)]
|
|
0
|
0
|
1
|
0
|
|
0
|
1
|
1
|
1
|
|
1
|
0
|
0
|
0
|
|
1
|
1
|
0
|
0
|
b) NOR
PARA A>B
|
A
|
B
|
NoA
|
NoB
|
No(A+B)
|
No(A+NoB)
|
No(NoA+NoB)
|
F
|
|
0
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
|
0
|
1
|
1
|
0
|
0
|
1
|
0
|
0
|
|
1
|
0
|
0
|
1
|
0
|
0
|
0
|
1
|
|
1
|
1
|
0
|
0
|
0
|
0
|
1
|
0
|
PARA A=B
|
A
|
B
|
NoA
|
NoB
|
No(A+NoB)
|
No(NoA+B)
|
F=No[No(A+NoB)+No(NoA+B)]
|
|
0
|
0
|
1
|
1
|
0
|
0
|
1
|
|
0
|
1
|
1
|
0
|
1
|
0
|
0
|
|
1
|
0
|
0
|
1
|
0
|
1
|
0
|
|
1
|
1
|
0
|
0
|
0
|
0
|
1
|
PARA A<B
|
A
|
B
|
NoA
|
NoB
|
No(A+B)
|
No(NoA+B)
|
No(NoA+NoB)
|
F
|
|
0
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
|
0
|
1
|
1
|
0
|
0
|
0
|
0
|
1
|
|
1
|
0
|
0
|
1
|
0
|
1
|
0
|
0
|
|
1
|
1
|
0
|
0
|
0
|
0
|
1
|
0
|
No hay comentarios:
Publicar un comentario