CSCI 5610

Formal Languages and Computational Complexity

Credit Hours: 3
Contact Hours: 3

Catalog Description

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.

Prerequisite(s)

None

Syllabi

No syllabi uploaded yet.