The theory of computing, including finite automata, regular expressions and languages, context-free grammars and languages, push-down automata, pumping lemmas, the Chomsky hierarchy of language classes, Turing machines and computability, undecidability of the halting problem, reducibilities among decision problems and languages, time and space complexity, and NP-completeness and tractability.This is a first course on the theory of computing.
This course will be taught 95% or more online. Lectures will be recorded and posted on eLC. Daily exercises will support the content covered in the videos. Students will access all content on eLC. Regular office hours going over the exercises will be provided online. Exams will be offered online through eLC.
Course Information File: