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.
Prerequisite: CSC 2211
American International University-Bangladesh (AIUB)
408/1, Kuratoli, Khilkhet,
Dhaka 1229, Bangladesh