Lecture 7, Oct. 11, 2001.

Done in class:

(1) The Pumping Lemma:

    a proof

    the negation of the Pumping Lemma

    examples of applying the Pumping Lemma

(2) The number of states in NFA and DFA in terms of the size of a
    given regular expression

Assigned reading: Sec. 1.4.