|
Oct 31, 2024
|
|
|
|
CSC 410 - Theoretical Foundations of Computer Science Credits: 4 Topics include finite automata, regular languages, regular expressions, and regular grammars; pushdown automata and context-free languages; Turing machines; Church-Turing Thesis; the Halting Problem; undecidability; classes of languages, including the Chomsky hierarchy and the classes P, NP, and NP-Complete. Proof techniques for showing language (non)membership in a class.
Prerequisite(s): CSC 310 Graduate Credit: This course is not available for graduate credit.
Add to Portfolio (opens a new window)
|
|