Summer 2020 Course Descriptions
COMP 170-A Computation Theory
M. Allen
MW 6:00p-8:30p, Room To Be Announced
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.