Finite automata and regular expressions; push down automata and context-free grammars; Turing machines; Church's thesis; computability; NP-completeness.
Prerequisites
CSC 1700 :Y :D-
Prerequisite Courses
Last Offered
Fall 2025, Fall 2024, Fall 2023, Fall 2022