CMPSCI 401: Theory of Computation

David Mix Barrington

Spring, 2012

Homework Assignment #5

Posted Wednesday 4 April 2012

Due on paper in class, Wednesday 18 April 2012

There are eleven questions for 100 total points plus 10 extra credit. All are the textbook, Introduction to the Theory of Computation by Michael Sipser (second edition). The number in parentheses following each problem is its individual point value.

Students are responsible for understanding and following the academic honesty policies indicated on this page.

• Exercise 7.5 (5)

• Exercise 7.10 (5)

• Problem 7.16 (10)

• Problem 7.19 (5)

• Problem 7.26 (15)

• Problem 7.27 (15)

• Problem 7.34 (15)

• Problem 7.40 part c only (5) (We already know that this algorithm is correct.)

• Problem 7.41 (10)

• Problem 7.44 (15)

• Problem 7.47 (10XC) (You may want to research this one, which is fine if you cite your sources. It's important that the definition of TIME(f) here is for a one-tape TM. I'll give you most of the credit if you prove that TIME(n) on a one-tape TM equals the regular languages, though I'm not sure that's much help.)

Last modified 4 April 2012