SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN

Size: px

Start display at page:

Download "SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN"

Anis Chambers
7 years ago
Views:

1 Course Code : CS0355 SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Title : THEORY OF COMPUTATION Semester : VI Course : June 2014 November 2014 Day SECTION A SECTION B SECTION C Hour Timing Hour Timing Hour Timing Day am to 9.35 am Day pm to 3.10 pm Day am to am Day pm to 2.20 pm Day 5 3, am to am and 1.30 pm to 2.20 pm am to am am to am am to pm 1, am to 9.35 am & 1.30 pm to 2.20 pm am to pm - - Location : S.R.M.U CENTRAL LIBRARY BUIDING 12 th Floor Faculty Details Section Office Office Hour Mail id A & C Library Tuesday, sabanayagam.t@ktr.srmuniv.ac.in Building Wednesday,Thursday, B Library Building Required Text Books Friday Tuesday, Wednesday,Thursday, Friday jeyasudha.j@ktr.srmuniv.ac.in

30 pm to 2.20 pm Day 5 3,5 10.35 am to 11.25 am and 1.30 pm to 2.20 pm 1 8.45 am to 09.25 am 2 9.35 am to 10.25 am 4 11.25 am to 12.15 pm 1,5 8.45 am to 9.35 am & 1.30 pm to 2.20 pm - - 4 11.

2 1. J.E.Hopcroft, R.Motwani and J.D Ullman, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, H.R.Lewis and C.H.Papadimitriou, Elements of The theory of Computation, Second Edition, Pearson Education/PHI, J.Martin, Introduction to Languages and the Theory of Computation, Third Edition, TMH, Micheal Sipser, Introduction of the Theory and Computation, Thomson Brokecole, Web Resources Prerequisite : MA0102,MA0211 Objectives In this course, Students will have an understanding of finite state and pushdown automata. have a knowledge of regular languages and context free languages. know the relation between regular language, context free language and corresponding recognizers. study the Turing machine and classes of problems. Assessment Details Cycle Test - I : 10 Marks Cycle Test - II : 10 Marks Surprise Test : 5 Marks Attendance : 5 Marks Model Exam : 20 Marks Internals Total : 50 Marks Test Schedule S.No Date Test Topics Duration 1 As per Calender Cycle Test 1 Unit I & II 2 periods 2 As per Calender Cycle Test 2 Unit III & IV 2 periods 3 As per Calender Model Test Unit V 3 hours Outcomes

http://www.cis.upenn.edu/~cis511/ 2. http://en.wikipedia.org/wiki/theory_of_computation 3. http://geisel.csl.uiuc.edu/~loui/sdcr/. 4. http://www.math.niu.edu/~rusin/known-math/index/68qxx.

3 The Students will gain knowledge in various scripting languages and real time software development. Course Outcome Program Outcome To Learn the basics of finite automata Ability of the students to solve problems related to finite automata To know how to derive the Regular Expression Ability of the students to derive regular and Regular languages,context free expressions and context free languages. languages. To Understand how the push down automata Ability to know about the working of push and turning machine works. down automata and turning machine. To Learn how the undecidable problems can Ability to learn to solve the undecidable be solved problems Detailed Plan Unit I - AUTOMATA Introduction to formal proof Additional forms of proof Inductive proofs Finite Automata (FA) Deterministic Finite Automata (DFA) Non-deterministic Finite Automata (NFA) Finite Automata with Epsilon transitions. 1 Introduction of Theory of Computation Teaching Testing Reference 1 2 Formal Proof Introduction 1 3 s of formal proof 2 Demonstration 4 Additional forms of proof 1 Demonstration 5 Inductive proofs Finite Automata 1,3,4 7 Deterministic Finite Automata 1 8 DFA - ProblemsDFA Problems Non Deterministic Finite Automata- Problems 1 9 Non Deterministic Finite Automata- 1,3,4

students to derive regular and Regular languages,context free expressions and context free languages. languages. To Understand how the push down automata Ability to know about the working of push and turning machine works.

4 Problems Finite Automata with Epsilon Transitions -Problems 10 Finite Automata with Epsilon Transitions -Problems UNIT II - REGULAR EXPRESSIONS AND LANGUAGES 1 Regular Expression FA and Regular Expressions Proving languages not to be regular Closure properties of regular languages Equivalence and minimization of Automata. 1 Regular Expressions Introduction 2 Operations of Regular Expression and Construction of RE 3 Finite Automata and RE DFA to Regular Expression 4 DFA to Regular Expression by state elimination technique 5 DFA to Regular Expression Problems 6 Ardens Theorem 7 Converting Regular Expression to Autmata 50 Reference 1,2 1,3 Teaching Testing 8 Proving Languages not to be Regular 50 1,3 9 Closure properties of Regular Languages 10 Equivalence and Minimization of Automata Unit III - CONTEXT-FREE GRAMMAR AND LANGUAGES 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. Teaching Testing Reference 1 Context Free Grammar and 50 1,2

1 Regular Expressions Introduction 2 Operations of Regular Expression and Construction of RE 3 Finite Automata and RE DFA to Regular Expression 4 DFA to Regular Expression by state elimination

5 Languages Introduction 2 Context Free Grammar 3 Parse Tree - From Inference to trees Quiz,Gaming theorem 4 From Trees to derivations - Theorem Role Play 5 From derivations to recursive Demonstration reference 6 Ambiguity in Grammar and Languages 7 Push Down Automata 8 Language of PDA 9 Equivalence of PDA and CFG Demonstration 10 Deterministic PDA Demonstration UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES Normal forms for CFG Pumping Lemma for CFL - Closure Properties of CFL Turing Machines Programming Techniques for TM. 1 Properties of Context Free Languages - Introduction 2 Normal Forms of CFG Elimating Useless Productions and epsilon 3 Computing reachable symbols Referenc e & 2 Teaching Testing Demonstration Demonstration Demonstration 4 Pumping Lemma of CFL Demonstration 5 Closure Properties of CFL- Subsitution,Application 6 Closure Properties of CFL- Reversal,Intersection and inverse Homorphism and Role play

LANGUAGES Normal forms for CFG Pumping Lemma for CFL - Closure Properties of CFL Turing Machines Programming Techniques for TM.

6 7 Turning Machine 8 Language of TM 9 TM for Integer Functions 10 Programming Techniques for Turning Machine UNIT V UNDECIDABILITY A language that is not Recursively Enumerable (RE) An undecidable problem that is RE Undecidable problems about Turing Machine Post s Correspondence Problem - The classes P and NP. 1 Undecidability Referenc e Teaching Testing 2 A language that is not RE Demonstration 3 Codes of TM 4 An undecidable problems that is RE The universal languages 6 An undecidable problems about TM Quiz 7 Rices Theorem and Properties of RE 8 Post Correspondance Problem 9 The Classes of P and NP 50 1,3,4 10 Np Complete Problems BB Black Board PP Power Point Presentation Incharges HoD/SWE Course Coordinator

1 Undecidability Referenc e Teaching Testing 2 A language that is not RE Demonstration 3 Codes of TM 4 An undecidable problems that is RE 50 1 5 The universal languages 6 An

Model 2.4 Faculty member + student

Model 2.4 Faculty member + student Course syllabus for Formal languages and Automata Theory. Faculty member information: Name of faculty member responsible for the course Office Hours Office Number Email