This course will explore the theory of formal languages and computability. There will be two one-hour exams.
Topics include:
  1. Mathematical Preliminaries
  2. Alphabets and Languages
  3. Regular Languages
  4. Context-free Languages
  5. Turing Machines
  6. Turing Machines and Languages
  7. Decidability
  8. Introduction to Computational Complexity

Graduate students will be required to read a research paper and give a 10 minute summary of it at the end of the semester.

This file was last modified