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

(a) \(\overline {\bf{x}} {\bf{ = x}} \downarrow {\bf{x}}\)

(b) \({\bf{xy = (x}} \downarrow {\bf{x)}} \downarrow {\bf{(y}} \downarrow {\bf{y)}}\)

(c) \({\bf{x + y = (x}} \downarrow {\bf{y)}} \downarrow {\bf{(x}} \downarrow {\bf{y)}}\)

Short Answer

Expert verified

By using the NOR operator get the results.

(a) \(\overline x = x \downarrow x\)

(b) \(xy = \left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

(c) \(x + y = \left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

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

01

Definition

The complements of elements \(\overline 0 = 1\) and\(\overline 1 = 0\).

The Boolean sum + or OR is 1 if either term is 1.

The Boolean product (.) or AND is 1 if both terms are 1.

The NAND operator | is 1 if either term is 0.

The NOR operator\( \downarrow \)is 1 if both terms are 0.

02

Show the result of \(\overline {\bf{x}} {\bf{ = x}} \downarrow {\bf{x}}\).    (a)

Here \(\overline x = x \downarrow x\)

The NOR operator is 1 if either term is 0. Thus \(x \downarrow x\)is 1 if \(x\) is 0.

x

\(\overline x \)

\(x \downarrow x\)

0

1

1

1

0

0

The last two columns of the table are identical, which implies: \(\overline x = x \downarrow x\)

03

Evaluate the result of \({\bf{xy = (x}} \downarrow {\bf{x)}} \downarrow {\bf{(y}} \downarrow {\bf{y)}}\).(b)

Here \(xy = \left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

The NAND operator is 1 if either term is 0. Thus \(x \downarrow x\)is 1 if \(x\) is 0.

X

Y

\(x \downarrow x\)

\(\left( {y \downarrow y} \right)\)

\(xy\)

\(\left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

0

0

1

1

0

0

0

1

1

0

0

0

1

0

0

1

0

0

1

1

0

0

1

1

The last two columns of the table are identical, which implies: \(xy = \left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

04

Determine the result of \({\bf{x + y = (x}} \downarrow {\bf{y)}} \downarrow {\bf{(x}} \downarrow {\bf{y)}}\).(c)

Here \(x + y = \left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

The NAND operator is 1 if either term is 0. Thus \(x \downarrow y\)is 1 if \(x\) is 0.

X

Y

\(x \downarrow y\)

\(x + y\)

\(\left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

0

0

1

0

0

0

1

0

1

1

1

0

0

1

1

1

1

0

1

1

The last two columns of the table are identical, which implies: \(x + y = \left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

Therefore, by using the NOR operator get the results.

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

Which of these functions are self-dual?

\(\begin{array}{l}\left. {\bf{a}} \right)\;{\bf{F}}\left( {{\bf{x,y}}} \right) = x\\\left. {\bf{b}} \right)\;{\bf{F}}\left( {{\bf{x,y}}} \right) = {\bf{xy + \bar x\bar y}}\\\left. {\bf{c}} \right)\;{\bf{F}}\left( {{\bf{x,y}}} \right) = {\bf{x + y}}\\\left. {\bf{d}} \right)\;{\bf{F}}\left( {{\bf{x,y}}} \right) = {\bf{xy + \bar xy}}\end{array}\)

Design a circuit for a light fixture controlled by four switches, where flipping one of the switches turns the light on when it is off and turns it off when it is on.

Use a \({\bf{K}}\)-map to find a minimal expansion as a Boolean sum of Boolean products of each of these functions in the variables \({\bf{x,y}}\), and \({\bf{z}}\).

\(\begin{array}{l}{\bf{a) \bar xyz + \bar x\bar yz}}\\{\bf{b) xyz + xy\bar z + \bar xyz + \bar xy\bar z}}\\{\bf{c) xy\bar z + x\bar yz + x\bar y\bar z + \bar xyz + \bar x\bar yz}}\\{\bf{d) xyz + x\bar yz + x\bar y\bar z + \bar xyz + \bar xy\bar z + \bar x\bar y\bar z}}\end{array}\)

Construct a circuit for a half subtractor using AND gates, OR gates, and inverters. A half subtractor has two bits as input and produces as output a difference bit and a borrow.

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\).

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