CPS 615
Theory of Computation
This course introduces students to the theory of computation. Topics include: regular expressions and languages, finite state automata, context-free languages, pushdown automata, Turing machines, computability, and NP-completeness.
Prerequisites & course information
prerequisites: CPS 305 and CPS 420
Sources
- Course catalogue ↗2026-2027