CIS 1910 Lecture Notes - Lecture 17: Disjunctive Normal Form, Boolean Function, Boolean Expression

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 1910
• Professor: Luiza Antonie

Document Summary

Expression of functions: recall that a function is the sum of the minterms for which the values are always 1, given a function f (x, y), the possible minterms are: with the input/output table: X y, x y, y x, x y x y. 0 then, give an expression for the function using only addition and complement operations. The minterms that yield 1 are: x y and x y f (x, y) = x y + x y. = x y + x y. = x + y + x + y. Nand and nor: the nand (not and) operation is denoted by , the expression x y is equivalent to x y x y. 0: the nor (not or) operation is denoted by , the expression x y is equivalent to. X = x x x x x. {nand}, this implies that nand is functionally complete: a similar process is used to prove functional completeness of {nor}