Note: the constructions we have done this week are important and are sure to come up on the first exam. You need to do enough practice problems to be confident that you know how these constructions work. I strongly suggest that you do more than just the problems I have asked you to hand in. There are plenty of problems in the text, and I can always come up with more if you need them.

Here are some suggested problems to do:
p. 80 #2.5.1 parts (a), (b), (c)

p. 89 #3.1.1 part (a), #3.1.2 part (b), #3.1.4 parts (a), (b)

p. 106 #3.2.1 parts (a), (b), (c), (d), #3.2.2 parts (a), (b), (c), (d)
#3.2.4 parts (a), (b), (c)

Here is a subset of these I would like you to hand in on Wednesday 2/22:
p. 80 #2.5.1 parts (a), (b), (c)
p. 89 #3.1.1 part (a)
p. 106 #3.2.2 parts (a), (b), (c), (d) #3.2.4 part (c)

Also, I would like you to complete the proof that epsilon-NFA's accept only regular languages. In class we gave a construction that makes a DFA that we said was equivalent to a given epsilon-NFA. Your job is to show that they really are equivalent: show that these two automata accept the same strings. I realize that you could find this in the text, but I want you to say it in your own words.