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

p. 66 #2.3.1, #2.3.2, #2.3.3, #2.3.4 parts (a), (b)

p. 72 #2.4.1 part (a)

Here is a subset of these I would like you to hand in on Wednesday 2/16:
p. 54, #2.2.4 parts (a), (c)
p. 66 #2.3.1, #2.3.3, (Note that the problem states automata via their transitions; p,q,r,s,t are
      states; 0 and 1 are input symbols)
p. 72 #2.4.1 part (a)

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.