Spring 2023 Course Descriptions
CS 170-01 Computation Theory
A. Di Lillo
TR 1:30-2:45, Pearson 104
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.