Computer Science 4602, Fall 2018
Assignment 2

Exercises are from Sipser, third edition, beginning on page 83.

1. 1.3
2. 1.5(c, d, f)
3. 1.6(a, f, i, k)
4. 1.7(b, c, d, h)
5. 1.16(a, b). Show the set of NFA states inside each DFA state.
6. 1.17(a, b). Number the NFA states. Show the set of NFA states inside each DFA state.
7. 1.29(b). But use the method covered in class, not the Pumping Lemma.
8. 1.36
9. 1.46(a). But use the method covered in class or closure results, not the Pumping Lemma.