Indian Institute of Information Technology, Nagpur Department of Computer Science and Engineering Session 2019-2020 Course: Theory Of Computation (CSL 303) Teaching Plan Sr. No. | Name of the Topic No. of | Remarks lectures and CO required _| covered 1 _| Preliminaries - Sets, operations 1 cos 2 | relations, countability and diagonalisation 2 CO 3 | Induction and proof methods- pigeon-hole principle and 2 Coa simple applications 4 | concept of language - grammars and production rules - 7 cO3 Chomsky hierarchy. 3 _ | Deterministic finite automata - non determinism, conversion 3 COI to deterministic automata 6 _[e-closures 2 cor 7__| minimization of automata 3 COL 8__| Regular grammars 2 COL 9 | regular expressions, regular sets 4 COL 10 | Pump lemma for regular sets 2 COL 11 | closure properties of regular sets, decision properties for 1 cor regular sets, 12 | Context - free languages, parse trees and ambiguity T CO1,2 13 | reduction of CFGS, Chomsky and 2 COI, 2 Griebach normal forms 14 | push - down Automata (PDA) 3 COL? 15 | non determinism 1 CO1,.2 16 | CFLs and PDAs — Pumping lemma for context free 2 COl,2 languages T7__| Closure and decision properties of CFLs. 1 COl,2 18] Turing Machines variants, recursively enumerable (F.e.) sets, 2 C04, 5 recursive sets: 19 _ [TM as computer of function 6 COS 20__| decidability and solvability 1 C04, 5 21 | Halting Problem, reductions 1 C04, 5 22 | Post correspondence Problem (PCP) and unsolvability of 2 C04, 5 ambiguity problem of CFGs. 23 __| primitive recursive and partial recursive functions 2 C04, 5 24 | Church -Turing thesis - convergence of view points of what T C045 “computability” is : Semi formal treatment. Kt Qua Mrs. Khushboo Jain