Question

tabulate the PLA programming table for the four boolean functions listed below. minimize the numbers of product terms. a(x, y, z) = (1, 3, 5, 6) b(x, y, z) = (0, 1, 6, 7) c(x, y, z) = (3, 5) d(x, y, z) = (1, 2, 4, 5, 7) solution of morris mano 5th edition

Answer 1

Answer:

(a×x+a×y+z ) 1×3×5×6) b×x+b×y +b×z