Turing Machine image, taken from WorldOfComputing.net

Course Schedule

Week 1 To Do:
  • Review Chapter 0 Exercises (0.1 - 0.9)
  • Review Chapter 0 Problems 0.11 and 0.13
Lecture 1:
  • Discuss course expectations and main goals
Lecture 2:
  • Review of discrete mathematics
Lecture 3:
  • More review
Week 2 To Do:
  • Read Section 1.1
Lecture 1:
  • No class
Lecture 2:
Lecture 3:
Week 3 To Do:
Lecture 1:
Lecture 2:
Lecture 3:
  • Quiz 01
Week 4 To Do:
Lecture 1:
  • Regular Expressions (Section 1.3)
Lecture 2:
  • Regular Expressions and Finite Automata (Section 1.3)
Lecture 3:
  • Quiz 02
Week 5 To Do:
Lecture 1:
  • Quiz 02 Review
Lecture 2:
  • Proving regularity
Lecture 3:
  • More proofs with regular languages
Week 6 To Do:
Lecture 1:
  • Practice with proofs
Lecture 2:
  • Proving nonregularity
Lecture 3:
  • The Pumping Lemma
Week 7 To Do:
  • ..
Lecture 1:
  • Using the pumping lemma
Lecture 2:
Lecture 3:
Week 8 To Do:
Lecture 1:
  • More Pumping Lemma
Lecture 2:
Lecture 3:
  • More comments on the Pumping Lemma
Week 9 To Do:
  • -
Lecture 1:
  • Introduction to Pushdown Automata
Lecture 2:
  • Introduction to Context-Free Grammars
Lecture 3:
  • Quiz retakes
Week 10 To Do:
Lecture 1:
Lecture 2:
Lecture 3:
Week 11 To Do:
Lecture 1:
  • Pumping Lemma for Context-Free Languages
Lecture 2:
  • More Pumping
Lecture 3:
  • Context-Free Languages and Beyond
Week 12 To Do:
Lecture 1:
  • Introduction to Turing machines (Section 3.1)
Lecture 2:
  • More Fun with Turing machines (Section 3.2)
Lecture 3:
Week 13 To Do:
  • -
Lecture 1:
  • -
Lecture 2:
  • -
Lecture 3:
  • -
Week 14 To Do:
  • -
Lecture 1:
  • -
Lecture 2:
  • -
Lecture 3:
  • -
Week 15 To Do:
Lecture 1:
  • Finishing up Undecidability
Lecture 2:
Lecture 3:
  • Review

Resources