CS 162 - Automata Theory Homework 6, 25 Points
Due: Friday, February 24, 11:55pm

  1. 5 points. Exercise 3.2(d,e) in Sipser.
  2. 5 points. Exercise 3.8(b) in Sipser.
  3. 5 points. Give a high-level description of a Turing machine for deciding the language of all strings of the form anbncn, where n is at least 1.
  4. 5 points. Give a high-level description of a Turing machine for deciding the language of all strings of the form aibj, where j = i2 and i is at least 1.
  5. 5 points. Problem 3.13 in Sipser.