CS 6505                     Spring 2006

Homework Set 1

Due: Tuesday, January 24

1. Sipser Problem 1.31, on page 88 of the text.

2. Sipser Problem 1.55 (parts a through f), on page 91 of the text.

3. Show that Turing recognizable languages are closed under
   concatenation. (You may use any variant of Turing machines with
   equivalent power.)

4. Sipser Problem 3.14, on page 161 of the text.