CSC612 Foundations of Computer Science

[3–0, 3 cr.]

This course covers finite automata and regular expressions, context-free grammars, pushdown automata, properties of regular and context-free languages, Turing machines, undecidability, computational complexity, Cook-Levin theorem and the polynomial time hierarchy. 

Note: This course has not been taught since Fall 2021 and will not be taught during the academic year 20234-2025.