Basic Mathematical Concepts; Finite Automaton; Non-determinism and Non-regular languages; DFA minimization and conversion of NFA, RE; Turing Machine; Context Free Grammar and Push Down Automata; Decidability and Undecidability; Recursion theorem and Rice's theorem, Halting problem; Theory of NP completeness; Space complexity.

Credit: 3
Prerequisite: CSC 2211