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

Are these sets of operators functionally complete?

a) \(\left\{ {{\bf{ + ,}} \oplus } \right\}\)

b) \(\left\{ {\,{\bf{,}} \oplus } \right\}\)

c) \({\bf{\{ \cdot,}} \oplus {\bf{\} }}\)

Short Answer

Expert verified

(a) \(\left\{ { + , \oplus } \right\}\)is not functionally complete.

(b)\(\left\{ {\,, \oplus } \right\}\)is not functionally complete.

(c)\(\left\{ {\cdot, \oplus } \right\}\)is not functionally complete.

Step by step solution

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 \(\left( {\bf{.}} \right)\) 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.

\({\bf{x}} \oplus {\bf{y}}\) if and only if exactly one of the two terms is equal to 1.

02

First the solution of\(\left\{ {{\bf{ + ,}} \oplus } \right\}\).

(a)

Now first consider the set\(\left\{ { + , \oplus } \right\}\).

Here\(0 \oplus 0 = 0 = 0 + 0\). This then implies that every function uses only the operation\( + \) and \( \oplus \) will 0 as output when all inputs are 0.

However, it is then not possible to construct a function that has only 0’s as input and 1 as output. Thus, such functions cannot be written using only the operation \( + \)and\( \oplus \), which means the set \(\left\{ { + , \oplus } \right\}\) is not functionally complete.

03

Evaluate the\(\left\{ {\,{\bf{,}} \oplus } \right\}\).

(b)

Consider the set\(\left\{ {\,, \oplus } \right\}\).

Here\(\overline {\left( {x \oplus y} \right)} = \overline x \oplus y,\,\,x \oplus x = 0,\,\,x \oplus \overline x = 1,\,\,x \oplus 1 = \overline x ,\,\,x \oplus x = x\).

However, it is not possible to express \(x + y\) in terms of \( - \) and\( \oplus \), which means that \(\left\{ {\,, \oplus } \right\}\) is not functionally complete.

04

determine the result of\({\bf{\{ \cdot,}} \oplus {\bf{\} }}\).

(c)

Consider the set\(\left\{ {\cdot, \oplus } \right\}\).

Here\(0.0 = 0 = 0 \oplus 0\). This implies that every function uses only the operation (.) and \( \oplus \) as output when all input is 0.

However, it is then not possible to construct a function that has only 0’s as input and 1 as output. Thus, such functions cannot be written using only the operation (.) and\( \oplus \), which means the set \(\left\{ {\cdot, \oplus } \right\}\) is not functionally complete.

Therefore, parts a, b, and c are not functionally complete sets.

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

Find the sum-of-products expansion of the Boolean function\({\bf{F}}\left( {{\bf{w, x, y, z}}} \right)\) that has the value 1 if and only if an odd number of w, x, y, and z have the value 1.

Construct a \({\bf{K}}\)-map for \({\bf{F(x,y,z) = xz + yz + xy\bar z}}{\bf{.}}\) Use this \({\bf{K - }}\)map to find the implicants, prime implicants, and essential prime implicants of \({\bf{F(x,y,z)}}\).

Which rows and which columns of a \(4{\bf{ \ast }}16\) map for Boolean functions in six variables using the Gray codes \({\bf{1111}},{\bf{1110}},{\bf{1010}},{\bf{1011}},{\bf{1001}},{\bf{1000}},{\bf{0000}},{\bf{0001}},{\bf{0011}},{\bf{0010}},{\bf{0110}},{\bf{0111}},{\bf{0101}},{\bf{0100}},{\bf{1100}},{\bf{1101}}\) to label the columns and \({\bf{11}},{\bf{10}},{\bf{00}},{\bf{01}}\) to label the rows need to be considered adjacent so that cells that represent min-terms that differ in exactly one literal are considered adjacent\(?\)

\(a)\) What does it mean for a set of operators to be functionally complete\(?\)

\(b)\)Is the set \(\{ {\bf{ + }}, \cdot \} \) functionally complete\(?\)

\(c)\)Are there sets of a single operator that are functionally complete\(?\)

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