CSCI 1323 (Discrete Structures), Spring 2006:
Homework 4

Assigned:

February 24, 2006.

Due:

March 6, 2006, at 5pm. Not accepted late.

Credit:

30 points.

Problems

Do the following problems. You do not need to turn in answers for the ones marked ``Not to turn in''. Most such problems will be those for which the textbook provides an answer in the back of the book, so you can check your work.

If you are covered by the Academic Honor Code, treat this assignment as pledged work (writing ``pledged'' and your name on what you turn in).

1. (Not to turn in.) Do problem 7 on p. 140 of the textbook.

2. (Not to turn in.) Do problem 34 on p. 142 of the textbook.

3. (5 points) Do problem 35 on p. 142 of the textbook.

4. (Not to turn in.) Do problem 40 on p. 143 of the textbook.

5. (5 points) Do problem 41 on p. 143 of the textbook. For every string of symbols that belongs to $W$, show how it can be generated by using the recursive definition of $W$. (See Example 33 and Practice 14 on p. 124 for examples of how to show that a string fits a recursive definition.)

6. (Not to turn in.) Do problem 46 on p. 143 of the textbook.

7. (5 points) Do problem 47 on p. 143 of the textbook.

8. (Not to turn in.) Do problem 64 on p. 145 of the textbook.

9. (5 points) Do problem 65 on p. 145 of the textbook.

10. (Not to turn in.) Do problem 73 on p. 146 of the textbook.

11. (5 points) Do problem 77 on p. 146 of the textbook.

12. (Not to turn in.) Do problem 79 on p. 146 of the textbook.

13. (Not to turn in.) Do problem 82 on p. 146 of the textbook.

14. (5 points) Do problem 81 on p. 146 of the textbook.