CSCI 6339 Theoretical Foundations of Computer Science

Examines classes of languages and computation models. The topics include finite state automata, pushdown automata, Turing machines and the Chomsky hierarchy of formal languages, decidability and undecidability theory, and computational complexity theory, which includes NP-Completeness and Reductions.

Credits

3

Schedule Type

Lecture

Grading Basis

Standard Letter (A-F)

Administrative Unit

Computer Science

Offered

As scheduled