1. Do Exercise 3.2 parts b, c, d, and e.
2. Give a formal description of a Turing machine that recognizes the language
{ an2 : n = 0, 1, 2, ...}.
3. Do Exercise 3.8(b). (See the sample solution to Exercise 3.8(a) on page 191 of Sipser.)
4. Do Problem 3.15(b)
5. Do Problem 3.16(d).
Extra credit. Do Problem 3.18 or 3.19.