equivalent truth table and gate level implementation.
A boolean function is an expression consisting for binary variables, binary operators and constants (1 or 0). The Boolean function can be used to represent a logical scenario. Sometimes the functions can be minimized to lowest possible number of variables. In this section we will discuss boolean function with an example. We will also derive a truth-
function example: F1 = (x + y)z’
Where F1 is a Boolean function of binary variables and binary operators. The binary variables and operators are specified below.
Binary variables = x, y and z
Binary operators = Parentheses, NOT, AND and OR
Solving or minimization of the functions are performed in a particular precedence shown below.