| Section | Problem | Notes
|
|---|
| 1.3 | 62b | Clearly justify your answer.
|
| 5.1 | 20 | Don't make this one harder than it is. It is fairly straightforward.
|
| 5.3 | 8ab | For b: recursive definitions do not always have to be based on the immediately preceding term.
|
| 12 | Recall that f0=0 and f1=1. This one should not be too difficult if you use the correct proof technique.
|
| 24a | The empty string (λ) is a palindrome.
|
| 38
|
| Review Question | 1 | On page 439 |