• [ ] Chapter 1: Basic Concepts
• [ ] Chapter 2
  • [ ] Deterministic Finite Acceptors (DFA)
  • [ ] Non-deterministic Finite Acceptors (NFA)
  • [ ] Equivalence of DFA and NFA
• [ ] Redo Assignment 1 questions
• [ ] Chapter 3
  • [ ] Regular expressions
  • [ ] Connection between RE and regular languages
• [ ] Chapter 4
  • [ ] Closure properties of regular languages
  • [ ] Elementary questions of regular languages
  • [ ] Identifying non-regular languages (pumping lemma)
• [ ] Context-Free Languages
  • [ ] Chapter 5
    • [ ] Context-Free Grammars
  • [ ] Chapter 6
    • [ ] Methods for transforming grammars
    • [ ] Chomsky normal form
  • [ ] Chapter 7
    • [ ] Non-deterministic pushdown automata (NPDA)
    • [ ] Pushdown automata (PDA) and context-free languages
  • [ ] Chapter 8
    • [ ] Pumping lemma for context-free languages
• [ ] Turning Machine (TM) and Other Types of Languages
  • [ ] Chapter 9
    • [ ] Standard Turing machine (TM)
    • [ ] Turing’s thesis (Church-Turing Thesis)
  • [ ] 10.1 Minor variations on the turing machine theme
• [ ] Other topics
  • [ ] 11.1 RECURSIVE (DECIDABLE) AND RECURSIVELY ENUMERABLE (ENUMERABLE) LANGUAGES
  • [ ] 11.4 THE CHOMSKY HIERARCHY
  • [ ] 12.1 SOME PROBLEMS THAT CANNOT BE SOLVED BY TURING MACHINES (Halting Problem)
  • [ ] 12.2 Rice's Theorem
• [ ] Redo practice midterm questions
• [ ] Redo midterm questions
• [ ] Redo review questions on Brightspace