Fall 2022 Course Descriptions

CS 170-01S Computation Theory

M. Monroe
TR 1:30-2:45, Joyce Cummings Center 270
H+ Block

Models of computation: Turing machines, pushdown automata, and finite automata. Grammars and formal languages including context-free languages and regular sets. Important problems including the halting problem and language equivalence theorems.

Prerequisite: COMP 15 and COMP/MATH 22 or 61.

Back to Main Courses Page