|
|
|
Apr 23, 2024
|
|
2019-2020 Undergraduate Catalog [ARCHIVED CATALOG]
|
CSC 332 - Theory of Computation
Credit Hours: 3
Lecture Hours: 3
Lab Hours: 0
This course covers basic theoretical principles embodied in formal languages, automata, computability, and computational complexity. Topics include finite automata, pushdown automata, non-determinism, regular expressions, context-free grammars, Turing machines, Gödel numbering, Church’s thesis, the halting problem, unsolvability, and computational complexity.
Prerequisite: CSC 220
Please click here for Book Information
|
|
|
