Fall 2022 Course Descriptions
CS 170-M1 Computation Theory
R 6:00p-7:30p, Online (synchronous)
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.