|
|
|
Jan 15, 2025
|
|
CS 365 - Theory of Computation
Lecture Hours: 3
Lab Hours: 0
Credit Hours: 3
Terms Offered: Spring, on demand
Introduction to formal languages and automata, computability, and complexity. Topics include the DFAs, CFGs, pumping lemmas, Turing machines, the Church-Turing Thesis, non-determinism, and NP-completeness. Prerequisite: CS 220 and CS 332 with a grade of “C” or better.
Add to Portfolio (opens a new window)
|
|
|