Skip to main content

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.
Weekly Contact: Lab:1 hr. Lecture:3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1

Prerequisites

CPS 305 and CPS 420

Antirequisites

None

Co-Requisites

None

Custom Requisites

None

Mentioned in the Following Calendar Pages

*List may not include courses that are on a common table shared between programs.

Computer Science