CSCI 5610 - Formal Languages and Computational Complexity

(3 credits)

Prerequisites: MATH 2710, CSCI 2210 or consent of the instructor.

Problem-solving is a fundamental aspect of computer science. This course teaches students how to reduce a computational problem to its simplest form and analyze the problem to determine its inherent computational complexity. Topics include formal languages and automata theory, Turing machines, computational complexity, and the theory of NP-completeness.

When Offered: Variable.

View the Fall 2025 Schedule of Classes

View the Spring 2026 Schedule of Classes