TCSS 440/540, Spring 2014

Handouts

  1. Course Organization

  2. Proof by induction (pencast)
  3. Guide to proof by induction

  4. Slides: introduction to the course
  5. Fact 1 and Application
  6. Proof of Correctness of the Cross Product machine of Theorem 1.25
  7. Solution and proof of Suggested Problem #4 on HW #4 (the mod 5 DFA)

  8. Proof of Correctness of Theorem 1.39
  9. Subset construction example

  10. "Drill" questions regarding DFAs, NFAs, regular expressions, and context-free grammars
  11. Some slides on the pumping lemma for regular languages
  12. Proof that L(G) = { 0n1n | n 0 }. (pencast)

Assignments

Exams

    Exam & Midterm Information

On-line resources and fun links: