SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY

Transcription

1 SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0204 Course Title : Theory of Computation Semester : IV Course Time : Jan May 2012 A B C D E Hour Timing Hour Timing Hour Timing Hour Timing Hour Timing & , , , Location : Tech Park Faculty Details: Sec. Name Office Office hour Mail id A K.Senthil Kumar Senthilkumar.k@ktr.srmu niv.ac.in B K.Sathiyapriya sathiyapriya.k@ktr.srmuni L Lab v.ac.in C Mr.S.Pradeep Pradeep.su@ktr.srmuniv.a c.in D E T.Sabhanayagam Mr.S.Pradeep 706A sabhanayagam.t@ktr.srmu niv.ac.in Pradeep.su@ktr.srmuniv.a c.in Required Text Books: 1. E.Hopcroft and J.D.Ullman, "Introduction to Automata Theory, Languages and Computation", Pearson, Education 2. Michael Sipser, "Introduction to the Theory of Computation", Thomson Asia, 2004

2 ONLINE REFERENCES: Prerequisite : CS0202 Principles of Programming Languages Objectives: 1. To study the concepts of Various languages 2. To learn about the various computing devices like FSM,PDA,Turing machines 3. To learn the various computability concepts Assessment Details: Cycle I : 10 Marks Surprise / : 05 Marks Cycle II : 10 Marks Model Exam : 20 Marks Attendance : 05 Marks Schedule: S.No. DATE TEST TOPICS DURATION 1 2/02/2012 Cycle - I Unit I & II 2 periods 2 8/03/2012 Cycle - II Unit III & IV 2 periods 3 12/04/2012 Model Exam All 5 units 3 Hrs Outcomes : Students who have successfully completed this course will have full understanding of the following concepts 1. Various Complexity classes 2. Various ideas of NP COMPLETE,NP-HARD Problems 3.V arious Computing Devices Detailed Session Plan: FINITE AUTOMATA

3 Introduction - Basic Mathematical Notation and techniques- Finite State systems - Basic Definitions - Finite Automaton - DFA & NDFA - Finite Automaton with -moves - Regular Languages- Regular Expression - Equivalence of NFA and DFA - Equivalence of NDFA's with and without -moves - Equivalence of finite Automaton and regular expressions -Minimization of DFA - Pumping Lemma for Regular sets - Problems based on Pumping Lemma. Sessi on No. 1 Topics to be covered Preliminaries sets, relations, functions, graphs Time (min) Ref Teaching Method 2 Trees, Induction Principles and Notations ing Method 3 Introduction to Finite Automata 4 Finite Automata Basic definitions Finite Automaton - DFA & NDFA, Finite Automaton with -moves Regular Languages- Regular Expression,, Equivalence of NFA and DFA - Equivalence of NDFA's with and without -moves Equivalence of finite Automaton and regular expressions Minimization of DFA - Pumping Lemma for Regular sets 50 1,3 BB 50 1,3 BB,, GRAMMARS Grammar Introduction - Types of Grammar - Context Free Grammars and Languages- Derivations and Languages - Ambiguity- Relationship between derivation and derivation trees - Simplification of CFG - Elimination of Useless symbols - Unit productions - Null productions - Greiback Normal form - Chomsky normal form - Problems related to CNF and GNF. 10 Grammar Introduction Discussion Types of Grammar - Context Free Illustration by examples 11 Grammars and Languages Derivations and Languages Ambiguity- Relationship between derivation and derivation trees 14 Simplification of CFG 15 Elimination of Useless symbols, Unit productions, Null productions 16 Greiback Normal form,cnf Problem solving, surprise test 17 Problems related to CNF and GNF. Problem solving, surprise test

4 PUSHDOWN AUTOMATA Pushdown Automata - Definitions - Moves - Instantaneous descriptions - Deterministic pushdown automata - Equivalence of Pushdown automata and CFL - pumping lemma for CFL - problems based on pumping Lemma Pushdown Automata Definitions - Moves Instantaneous descriptions 21 Deterministic pushdown automata Surprise Equivalence of Pushdown automata and CFL pumping lemma for CFL 24 problems based on pumping Lemma TURING MACHINE Turing Machines- Introduction - Formal definition of Turing machines - Instantaneous descriptions- Turing Machine as Acceptors - Turing Machine as Transducers Computable Languages and functions - Turing Machine constructions - Modifications of Turing Machines Turing Machines Introduction - Formal definition of Turing machines Instantaneous descriptions Turing Machine as Acceptors Turing Machine as Transducers Computable Languages and functions Turing Machine constructions,, 34 Turing Machine constructions 35 Turing Machine constructions 36 Modifications of Turing Machines. COMPUTATIONAL COMPLEXITY Undecidability- Basic definitions- Decidable and undecidable problems - Properties of Recursive and Recursively enumerable languages - Introduction to Computational Complexity: Definitions-Time and

5 Space complexity of TMs - complexity classes - introduction to NP-Hardness and NP-Completeness 37 Undecidability, Basic definitions 38 Decidable and undecidable problems 39 Properties of Recursive and Recursively enumerable languages 40 Introduction to Computational Complexity 41 Introduction to Computational Complexity 42 Definitions-Time and Space complexity of TMs 43 complexity classes 44 complexity classes 45 Introduction to NP-Hardness and NP- Completeness BB BlackBoard PPT PowerPoint Presentation