19.6: Programming Exercises

1

A Boolean or switching function on \(n\) variables is a map \(f : \{O, I\}^n \rightarrow \{ 0, I\}\text{.}\) A Boolean polynomial is a special type of Boolean function: it is any type of Boolean expression formed from a finite combinatio4n of variables \(x_1, \ldots, x_n\) together with \(O\) and \(I\text{,}\) using the operations \(\vee\text{,}\) \(\wedge\text{,}\) and \('\text{.}\) The values of the functions are defined in Table \(19.33\). Write a program to evaluate Boolean polynomials.

\(Table \text { } 19.33.\) Boolean polynomials