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

5 points.
Exercise 3.2(d,e) in Sipser.

5 points.
Exercise 3.8(b) in Sipser.

5 points.
Give a highlevel description of a Turing machine for deciding
the language of all strings of the form
a^{n}b^{n}c^{n}, where n is at least 1.

5 points.
Give a highlevel description of a Turing machine for deciding
the language of all strings of the form
a^{i}b^{j}, where j = i^{2} and i is at least 1.

5 points.
Problem 3.13 in Sipser.