Fall 2021 Course Descriptions

CS 170-01 Computation Theory

M. Allen
MW 9:00-10:15, Braker Hall 101
R+ 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