Computer Science 4602, Fall 2018
Assignment 2
Assigned: |
Monday, September 10 |
Due: |
Friday, September 21, at the beginning of class |
Exercises are from Sipser, third edition, beginning
on page 83.
- 1.3
- 1.5(c, d, f)
- 1.6(a, f, i, k)
- 1.7(b, c, d, h)
- 1.16(a, b). Show the set of NFA states inside each DFA state.
- 1.17(a, b). Number the NFA states. Show the set of NFA states inside each DFA state.
- 1.29(b). But use the method covered in class, not the Pumping Lemma.
- 1.36
- 1.46(a). But use the method covered in class or closure results,
not the Pumping Lemma.