CSE 322 Assignment #2
Winter 1998

Due: Friday, January 23, 1998.

Reading assignment: Read Sipser's book, section 1.2. The following problems are from the First Edition of the text.

Problems:

  1. Page 84, Exercise 1.5

  2. Page 88, Problem 1.24

  3. Page 88, Problem 1.27

  4. Page 85, Exercise 1.12.

  5. (Bonus) Page 89, Problem 1.30

  6. (Bonus) Page 88, Problem 1.25, i.e. show that finite automata can add numbers in binary provided the input is interleaved properly.