Homework SourseNeed help for 1 2 Theory of Computation Cs 320 Homework 1 D
Need help for #1 & #2.
Theory of Computation (Cs 320) Homework #1 Date Due February 8, 2017 (Only if you cannot attend dass in person, Have your written solution ready at the beginning ofdass by 600 pm on the date due) email your solutions lo the instructor at LTcs320@yahoo.com Maximum score: 50 peints 1 Fa in each shaded cell of the following with one of the (countably infinite), or U countably infinite) to indicate the result of performing the union operation (un between various sets of UNION. 2. Following the instructions in the previous question, complete this chart with regard to the intersectionSolution
As all this set are infinite but N,Z,Q can be mapped so they are C while Q\' and R are U not so even their union is U. same procedure follow for intersection
| Union | N | Z | Q | Q\' | R |
|---|---|---|---|---|---|
| N | C | C | C | U | U |
| Z | C | C | C | U | U |
| Q | C | C | C | U | U |
| Q\' | U | U | U | U | U |
| R | U | U | U | U | U |
