SRM UNIVERSITY
FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING
DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN
Course Code : CS0355
Course Title : THEORY OF COMPUTATION
Semester : VI
Course Time : June 2014 –November 2014
Day SECTION A SECTION B SECTION C
Hour Timing Hour Timing Hour Timing
Day 1 - - - - 1 8.45 am to
9.35 am
Day 2 - - 6 2.20 pm to
3.10 pm
1,5 8.45 am to 9.35 am &
1.30 pm to 2.20 pm
Day 3 2 9.35 am to
10.25 am
1 8.45 am to 09.25 am
- -
Day 4 5 1.30 pm to
2.20 pm
2 9.35 am to 10.25 am
4 11.25 am
to 12.15 pm Day 5 3,5 10.35 am to
11.25 am and 1.30 pm to
2.20 pm
4 11.25 am
to 12.15 pm
- -
Location : S.R.M.U CENTRAL LIBRARY BUIDING 12th Floor Faculty Details
Section Office Office Hour Mail id A & C Library
Building
Tuesday ,
Wednesday,Thursday, Friday
B Library Building
Tuesday ,
Wednesday,Thursday, Friday
Required Text Books
1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and Computations”, Second
Edition, Pearson Education, 2003.
2. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second Edition, Pearson Education/PHI, 2003
3. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH, 2003.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.
Web Resources
1. 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.html#INTRO
Prerequisite : MA0102,MA0211
Objectives In this course, Students will
9 have an understanding of finite state and pushdown automata.
9 have a knowledge of regular languages and context free languages.
9 know the relation between regular language, context free language and corresponding recognizers.
9 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
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 and Regular languages ,Context free
languages.
Ability of the students to derive regular expressions and context free languages.
To Understand how the push down automata and turning machine works.
Ability to know about the working of push down automata and turning machine.
To Learn how the undecidable problems can be solved
Ability to learn to solve the undecidable problems
Detailed Session 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.
Session
No. Topics to be covered Time
(min) Reference Teaching Method
Testing Method 1 Introduction of Theory of
Computation
50
1 BB/PP Discussion
2 Formal Proof – Introduction 1 BB/PP Discussion
3 Methods of formal proof 2 BB/PP Demonstration
4 Additional forms of proof 1 BB/PP Demonstration
5 Inductive proofs 1 BB/PP Discussion
6 Finite Automata 1,3,4 BB/PP Discussion
7 Deterministic Finite Automata 1 BB/PP Discussion
8 DFA - ProblemsDFA – Problems Non –Deterministic Finite Automata- Problems
1 BB/PP Discussion
9 Non –Deterministic Finite Automata- 1,3,4 BB/PP Discussion
Problems
Finite Automata with Epsilon Transitions -Problems 10 Finite Automata with Epsilon
Transitions -Problems
1 BB/PP Discussion
UNIT II - REGULAR EXPRESSIONS AND LANGUAGES
Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular
languages – Equivalence and minimization of Automata.
Session
No. Topics to be covered Time
(min) Reference Teaching Method
Testing Method 1 Regular Expressions – Introduction
50
1,2
BB/PP Discussion 2 Operations of Regular Expression
and Construction of RE
BB/PP Discussion
3 Finite Automata and RE DFA to Regular Expression
BB/PP Discussion
4 DFA to Regular Expression by state elimination technique
1,3
BB/PP Discussion
5 DFA to Regular Expression Problems
BB/PP Discussion
6 Ardens Theorem
50 1,3
BB/PP Discussion 7 Converting Regular Expression to
Autmata
BB/PP Discussion
8 Proving Languages not to be Regular BB/PP Discussion 9 Closure properties of Regular
Languages
BB/PP Discussion
10 Equivalence and Minimization of Automata
BB/PP Discussion 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.
Session
No. Topics to be covered Time
(min) Reference Teaching Method
Testing Method
1 Context Free Grammar and 50 1,2 BB/PP Discussion
Languages – Introduction
2 Context Free Grammar BB/PP Discussion
3 Parse Tree - From Inference to trees – theorem
BB/PP Quiz ,Gaming
4 From Trees to derivations - Theorem BB/PP Role Play 5 From derivations to recursive
reference
BB/PP Demonstration
6 Ambiguity in Grammar and Languages
BB/PP Discussion
7 Push Down Automata BB/PP Discussion
8 Language of PDA BB/PP Discussion
9 Equivalence of PDA and CFG BB/PP Demonstration
10 Deterministic PDA BB/PP 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.
Session
No. Topics to be covered Time (min)
Referenc e
Teaching Method
Testing Method 1 Properties of Context Free
Languages - Introduction
50 1
BB/PP Demonstration 2 Normal Forms of CFG Elimating
Useless Productions and epsilon
BB/PP Demonstration
3 Computing reachable symbols
50 1 & 2
BB/PP Demonstration
4 Pumping Lemma of CFL BB/PP Demonstration
and Role play 5 Closure Properties of CFL-
Subsitution ,Application
BB/PP Discussion
6 Closure Properties of CFL-
Reversal,Intersection and inverse Homorphism
BB/PP Discussion
7 Turning Machine BB/PP Discussion
8 Language of TM BB/PP Discussion
9 TM for Integer Functions BB/PP Discussion
10 Programming Techniques for Turning Machine
BB/PP Discussion
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.
Session
No. Topics to be covered Time (min)
Referenc e
Teaching Method
Testing Method 1 Undecidability
50 1
BB/PP Discussion
2 A language that is not RE BB/PP Demonstration
3 Codes of TM BB/PP Discussion
4 An undecidable problems that is RE BB/PP Discussion
5 The universal languages BB/PP Discussion
6 An undecidable problems about TM BB/PP Quiz
7 Rices Theorem and Properties of RE BB/PP Discussion 8 Post Correspondance Problem
50 1,3,4
BB/PP Discussion
9 The Classes of P and NP BB/PP Discussion
10 Np –Complete Problems BB/PP Discussion
BB –Black Board
PP –Power Point Presentation
Incharges Course Coordinator
HoD/SWE
