U19CS503 THEORY OF COMPUTATION 3003 COURSE OUTCOMES At the end of the course, students will be able to © Compare various and analyze various Finite Automata * Construct finite automata from regular expressions and identify the properties of regular language © Design recognizers for different formal languages and Push Down Automata + Convert CFG to normal forms and design Turing machines for various problems * Determine the decidability and intractability of computational problems. CO/ PO, PSO Mapping (32/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak THEORY OF COMPUTATION Cos Programme Outcomes (POs) and Programme Specific Outcome (PSOs) POI | PO2 | POS | POS] POS | POG | POT | POS] POY | POI ] POI! | POI2 | PSOT | PSO2 | PSO3 cor}3 )2)/2/3f2)/2];ajif3)]a 2 2 3 1 coz} 3) 2)2/2/3)2)/2]/1/3] 3 2 3 1 3 3 cox} 3) 2)3 )/2/3)2)/1]1]3]3 3 3 1 3 3 co4f 3) 3) 3 a3}1]}2])2)3 3 3 2 3 3 cos} 3] 3 ]2]}2]/2]1]71]2]3]3 UNITI AUTOMATA 9 Introduction to formal proof — Additional forms of proof - Inductive proofs -Chomsky Hierarchy- Finite Automata (FA) - Deterministic Finite Automata (DFA) - Non- deterministic Finite Automata (NFA) — Finite automata with epsilon transitions, Case Study: Cruise Control UNITIT — REGULAR EXPRESSIONS AND LANGUAGES. 9 Regular expression ~ FA and Regular expressions ~ Proving languages not to be regular — Closure properties of regular languages — Equivalence and minimization of automata. UNITHI CONTEXT-FREE GRAMMAR AND LANGUAGES 9 Context Free Grammar (CFG) ~ Parse trees - Ambiguity in grammars and languages — Definition of the pushdown automata — Languages of a pushdown automata — Equivalence of pushdown automata and CFG — Deterministic pushdown automata- Pumping lemma for CFL — Closure properties of CFL 06.07.2022 Resulations-2019UNITIV TURING MACHINE 9 ‘Normal forms for CFG ~ ~Turing machines -Language of TM -Programming Techniques for TM- Variants in TM. Case study: Church’s Thesis-Godelization UNITV —_- UNDECIDABILITY 9 Recursively Enumerable (RE) - An Undecidable problem that is RE — Halting Problem- Post's correspondence problem —Rice Theorem-ClassesP and NP -NP Completeness-Relationship between Time Complexity and Space Complexity. Total: 45 hours TEXT BOOK 1. Hoperoff, J.B. Motwani, R. and Ullman, J.D “Introduction to Automata Theory, Languages and Computations”, 2nd Edition, Pearson Education, 2013. REFERENCES 1. MichealSipser, “Introduction of the Theory and Computation”, ThomsonBrokecole, 1997. 2. Martin, J., “Introduction to Languages and the Theory of Computation”, 3rd Edition, TMH, 2003. 3. Lewis, H. and Papadimitriou, C.H “Elements of the Theory of Computation”, 2nd Edition, Pearson Edueation/PHI, 2003, 4, Greenlaw, “Fundamentals of Theory of Computation, Principles and Practice”, Elsevier, 2008, 06.07.2022 Resulations-2019