A.V.

C College of Engineering, Mannampandal 609 305 Department of Computer Science & Engineering LESSON PLAN -Academic Year 2012 2013 (ODD Semester) Syllabus CS1303 THEORY OF COMPUTATION L 3 T 0 P 0 C 3

UNIT I AUTOMATA 9 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. UNIT II 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. UNIT III 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. UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9 Normal forms for CFG Pumping lemma for CFL Closure properties of CFL Turing machines Programming Techniques for TM. UNIT V UNDECIDABILITY 9 A language that is not Recursively Enumerable (RE) problems about turing machine An Undecidable problem that is RE Undecidable Posts correspondence problem The classes P and NP. Total: 45 TEXT BOOKS T1. Hopcroft, J.E. Motwani, R. and Ullman, J.D Introduction to Automata Theory, Languages and Computations, 2nd Edition, Pearson Education, 2003. T2. Lewis, H. and Papadimitriou, C.H Elements of the Theory of Computation, 2nd Edition, Pearson Education/PHI, 2003. REFERENCES R1. Martin, J., Introduction to Languages and the Theory of Computation, 3rd Edition, TMH, 2003. R2. Micheal Sipser, Introduction of the Theory and Computation, Thomson Brokecole, 1997. R3. Greenlaw, Fundamentals of Theory of Computation, Principles and Practice, Elsevier, 2008.

A.V.C College of Engineering Mannampandal 609 305 Department of Computer Science & Engineering LESSON PLAN -Academic Year 2012 2013 (ODD Sem)

Name of the Staff: K. Krishnakumari Subject

Branch/ Year/ Sem: CSE / III / V

: CS1303 Theory of Computation UNIT I AUTOMATA

S. No 1.

Topics with Sub Topics Introduction to formal proof 1.1 Deductive Proofs 1.2 Reduction to Definitions Additional forms of proof 2.1 Proving Equivalences about sets 2.2 The Contrapositive 2.3 Proof By Contradiction Inductive proofs 2.1 Induction on Integers 2.2 Structural Induction 3.3Mutual Induction Finite Automata (FA) Deterministic Finite Automata (DFA) Non-deterministic Finite Automata (NFA) 6.1 Equivalence of NFA and DFA Finite Automata with Epsilon transitions. 6.1 Epsilon Closure 6.2 Extended Transitions and Languages 7.3 Equivalence of Epsilon NFA and DFA Problems

No of Periods 2

Ref. Book No T1

Page No 19-27

Method of Teaching

Conventional

T1 R3

27-31 21-25

Conventional

2.

T1 R2 T1 T1 T1 R4

33-42 48-66 51-59 59-67 69-80 22-24

Conventional Conventional Conventional Conventional

3. 4. 5. 6.

2 2 2

T1

86-94

Conventional

7.

R5

55-99

Conventional

Total Periods : 14

UNIT II REGULAR EXPRESSIONS AND LANGUAGES S .No Topics with Sub Topics No of Periods Ref. Book No T1 R4 Page No Method of Teaching

1. Regular Expression i)Operations of Regular Languages ii)Construction of Regular expression 2. FA and Regular Expressions i)DFA to Regular Expressions ii)Converting Regular Expressions to Automata 3. Proving languages not to be Regular 4. Closure Properties of Regular Languages i)Under Boolean Operations ii)Under Reversal iii)Under Homomorphism 5. Equivalence and Minimization of Automata i)Testing Equivalence of States ii)Minimization of DFA 6. Problems

97-103 29-32

Conventional

T1 T2

104-121

Conventional

T1

139-143

Conventional

T1

145-159

Conventional

T1 T2

167-178 92-102

Conventional

R5

55-99

Conventional

Total Periods : 13

UNIT III CONTEXT-FREE GRAMMAR AND LANGUAGES S. No 1. Topics with Sub Topics Context-Free Grammar (CFG) 1.1 Derivations 1.2 Leftmost and Rightmost Derivation 1.3 Language of the CFG Parse Trees 2.1 Yield of the Tree 2.2 Inference, Derivations and Parse Tree 2.3 From Inference to Trees 2.4 From Trees to Derivations 2.5 From Derivations to Recursive Reference Ambiguity in Grammars and Languages 3.1 Ambiguous Grammar 3.2 Removing Ambiguity from Grammar 3.3 Inherent Ambiguity Pushdown Automata 4.1 Instantaneous Description Languages of a Pushdown Automata 5.1 Empty Stack to Final State 5.2 Final State to Empty Stack Equivalence of Pushdown Automata and CFG Deterministic Pushdown Automata. 7.1 DPDAs and CFL 7.2 DPDA and Ambiguity Problems No of Periods Ref. Book No Page No Method of Teaching

T1

183-190

Conventional

2.

T1 R4

195-204 82-87

OHP

3.

T1

219-225

Conventional

4. 5.

T1

233-238

Conventional

T1 T1 R3 T1

242-250 251-260 101-106 260-266

OHP

6. 7.

Conventional

Conventional

8.

R5

135-137

Conventional

Total Periods : 15

UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES S. No 1. Topics with Sub Topics Normal forms for CFG 1.1 Eliminating Useless Productions 1.2 Eliminating Epsilon Productions 1.3 Eliminating Unit Productions 1.4 Chomsky Normal Form Pumping Lemma for CFL Closure Properties of CFL 2.1 Substitutions 2.2 Reversal 3.3 Intersection 3.4 Inverse Homomorphism Turing Machines 4.4 Instantaneous Description 4.5 Language of a TM Programming Techniques for TM Storage in the State Multiple Tracks 7.6 Subroutines No of Periods Ref. Book No Page No Method of Teaching

T1 R4

269-280 92-99

OHP

2.

T1

295-305

Conventional

T1

330-340

Conventional

T1 R2 R4

343-348 341-352 153-159

Conventional

Total Periods : 13

UNIT V

UNDECIDABILITY S. No 1. Topics with Sub Topics A language that is not Recursively Enumerable (RE) 1.1 Enumerating the Binary Strings 1.2 Codes for Turing Machines 1.3 Diagonalization Language 1.4 Ld is not Recursively Enumerable An undecidable problem that is RE 2.1 Recursive Languages 2.2 Complements of Recursive and RE Languages 2.3 Universal Languages 2.4 Undecidabilty of UL Undecidable problems about Turing Machine 3.1 Reductions 3.2 Rices Theorem Posts Correspondence Problem 4.1 Definition of PCP 4.2 Modified PCP Formal Methods of Problem Solving (Contents Beyond the Syllabus) The classes P and NP 6.1 Solvable in Polynomial Time 6.2 Solvable in Non-Polynomial Time 6.3 Polynomial Time Reductions NP Complete Problems No of Periods Ref. Book No Page No Method of Teaching

T1

382-386

Conventional

2.

T1 T2

387-393 245-258

Conventional

3.

T1

397-404

Conventional

4.

T1

406-411

Conventional

5.

Downloaded Material 427436 440448

LCD

6.

T1

Conventional

7.

T1

Conventional

Total Periods : 13 Consolidated Total Periods : 68

BOOKS REFERED

T1: J.E.Hopcroft, R.Motwani and J.D Ullman, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, 2003. T2: H.R.Lewis and C.H.Papadimitriou, Elements of The theory of Computation, Second Edition, Pearson Education/PHI, 2003 R1. Martin, J., Introduction to Languages and the Theory of Computation, 3rd Edition, TMH, 2003. R2. Micheal Sipser, Introduction of the Theory and Computation, Thomson Brokecole, 1997. R3. Greenlaw, Fundamentals of Theory of Computation, Principles and Practice, Elsevier, 2008. Tutorial Hour Schedule Plan of Action (Problem Solving) Introduction to TOC(Class) Basic problems in Theorem Proving NFA and DFA Problems NFA to DFA Conversions Epsilon Elimination Problems Regular Expression Conversions Pumping Lemma Problems Minimization of Automata Problems in CFG Derivation Problems Pushdown Automata Problems Normal Form Problems Turing Machine Design Problems Programming Techniques of TM Undecidable Problems Posts Correspondence Problem

Sl.No 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.

16.

Class P and Class NP

A.V.C College of Engineering Mannampandal 609 305 Department of Computer Science & Engineering LESSON PLAN -Academic Year 2012 2013 (ODD Sem) Name of the Staff: K. Krishnakumari Subject Branch/ Year/ Sem: CSE / III / V

: CS1303 Theory of Computation Consolidated Schedule Sl.No 1. 2. 3. 4. 5. Total Unit I II III IV V Periods 14 13 15 13 13 68

Signature of the Faculty

Signature of the HOD

Principal