1. Automata
  2. Deterministic Finite Automata (Professor Wim van Dam's Notes *)
  3. Deterministic Finite Automata Notes and Assignment 1
  4. Notes on Nondeterministic Finite Automata
  5. Closure of Regular Languages under union,
    concatination, and the "Star" operation
  6. Regular Expressions and their Languages. Assignment 2
  7. Regular Languages,Nonregular Languages,
    and The Pumping Lemma *
  8. Notes on Kleene's Theorem, The Pumping Lemma,
    and Generalized Nodeterministic Finite Automata
           ContinuedSome Additional Details