CS 162 - Algorithms Homework 5, 25 Points
Due: Second Lecture of WEEK 6, 10 minutes before class starts.

  1. 5 points. Exercise 3.1c from Sipser.
  2. 5 points. Exercise 3.8b from Sipser.
  3. 5 points. Problem 3.11 from Sipser.
  4. 5 points. Problem 3.13 from Sipser.
  5. 5 points. Give a high-level description of a Turing machine that decides the language B = {0n1n2n | n ≥ 0 }.