Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that if \({\bf{F}}\) and \({\bf{G}}\) are Boolean functions represented by Boolean expressions in \({\bf{n}}\) variables and \({\bf{F = G}}\), then \({{\bf{F}}^{\bf{d}}}{\bf{ = }}{{\bf{G}}^{\bf{d}}}\), where \({{\bf{F}}^{\bf{d}}}\) and \({{\bf{G}}^{\bf{d}}}\) are the Boolean functions represented by the duals of the Boolean expressions representing \({\bf{F}}\) and \({\bf{G}}\), respectively. (Hint: Use the result of Exercise \(29\).)

Short Answer

Expert verified

The given \({F^d} = {G^d}\) is proved.

Step by step solution

01

Definition

The complement of an element: \(\bar 0 = 1\) and \(\bar 1 = 0\)

The Boolean sum \( + \) or \(O{\bf{ }}R\) is \(1\) if either term is \(1\) .

The Boolean product or \(A{\bf{ }}N{\bf{ }}D\) is \(1\) if both terms are \(1\) .

The dual of a Boolean expression interchanges the Boolean sum and the Boolean product, and interchanges\({\bf{0}}\)and\({\bf{1}}\).

De Morgan's laws

\(\begin{array}{c}\overline {\left( {xy} \right)} = \bar x + \bar y\\\overline {\left( {x + y} \right)} = \bar x\bar y\end{array}\)

02

Using the De Morgan’s law

Given:\(F\) and \(G\)are Boolean functions with \(n\) variables each\(F = G\)

To proof: \({F^d} = {G^d}\)

By the previous exercise:

\({F_d}\left( {{x_1},{x_2}, \ldots ,{x_n}} \right){\bf{ }} = \overline {F\left( {{{\bar x}_1},{{\bar x}_2}, \ldots ,{{\bar x}_n}} \right)} \)

\({G_d}\left( {{x_1},{x_2}, \ldots ,{x_n}} \right){\bf{ }} = \overline {G\left( {{{\bar x}_1},{{\bar x}_2}, \ldots ,{{\bar x}_n}} \right)} \)

Since \({F^d} = G\) :\(F\left( {{{\bar x}_1},{{\bar x}_2}, \ldots ,{{\bar x}_n}} \right) = G\left( {{{\bar x}_1},{{\bar x}_2}, \ldots ,{{\bar x}_n}} \right)\).

However, if two values are equal, then their complements are also equal:\(\overline {F\left( {{{\bar x}_1},{{\bar x}_2}, \ldots ,{{\bar x}_n}} \right)} = \overline {G\left( {{{\bar x}_1},{{\bar x}_2}, \ldots ,{{\bar x}_n}} \right)} \)

Therefore, you can obtain:\({F_d}\left( {{x_1},{x_2}, \ldots ,{x_n}} \right) = {G_d}\left( {{x_1},{x_2}, \ldots ,{x_n}} \right)\) by the result of the previous exercise.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

For each of these equalities either prove it is an identity or find a set of values of the variables for which it does not hold.

\(\begin{array}{l}a)x|(y\mid z){\bf{ = }}(x\mid y)|z\\b)x \downarrow (y \downarrow z){\bf{ = }}(x \downarrow y) \downarrow (x \downarrow z)\\c)x \downarrow (y\mid z){\bf{ = }}(x \downarrow y)\mid (x \downarrow z)\end{array}\)

Define the Boolean operator \( \odot \) as follows: \(1 \odot 1{\bf{ = }}1,1 \odot 0{\bf{ = }}0,0 \odot 1{\bf{ = }}0\), and \(0 \odot 0{\bf{ = }}1\).

Construct a circuit that compares the two-bit integers\({{\bf{(}}{{\bf{x}}_{\bf{1}}}{{\bf{x}}_{\bf{o}}}{\bf{)}}_{\bf{2}}}\)and\({{\bf{(}}{{\bf{y}}_{\bf{1}}}{{\bf{y}}_{\bf{o}}}{\bf{)}}_{\bf{2}}}\), returning an output of 1 when the first of these numbers is larger and an output of 0 otherwise.

Exercises 14-23 deal with the Boolean algebra \(\left\{ {{\bf{0,1}}} \right\}\) with addition,multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example \(8\).

22. Verify the unit property.

In Exercises 35โ€“42,Use the laws in Definition \(1\) to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, if \(x \vee y{\bf{ = }}0\), then \(x{\bf{ = }}0\) and \(y{\bf{ = }}0\), and that if \(x \wedge y{\bf{ = }}1\), then \(x{\bf{ = }}1\) and \(y{\bf{ = }}1\).

Show that cells in a \({\bf{K}}\)-map for Boolean functions in five variables represent minterms that differ in exactly one literal if and only if they are adjacent or are in cells that become adjacent when the top and bottom rows and cells in the first and eighth columns, the first and fourth columns, the second and seventh columns, the third and sixth columns, and the fifth and eighth columns are considered adjacent.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free