CSE 322 Assignment #5
Winter 1998

Due: Friday, February 20, 1998.

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

Problems:

1. For the languages in problem 1.17 prove that each language is not regular using the technique from the minimizing automata part 1 handout.

2. Apply the state minimization algorithm to the 8 state DFA given in Figure 1.18 in the text to show that it is minimal. Show your work.

3. Page 121, Problem 2.4 all parts except (e).

4. Page 121, Problem 2.15