RAJALAKSHMI ENGINEERING COLLEGE Thandalam, Chennai 602 105 LESSON PLAN Faculty Name : Staff Code Subject Name

e Year : : III Mr.C.Saravanakumar : CS67 THEORY OF COMPUTATION Semester B.E. C.S.E. : Subject Code V A & B : CS2303

Degree & Branch : Aim:

Section :

To have an introductory knowledge of automata, formal language theory and comput ability. Objectives: To have an understanding of finite state and pushdown automata. To have a knowledge of regular languages and context free languages. To know the relation between regular languages and context free languages and th eir corresponding recognizers. To study the Turing Machine and classes of problems. TEXT BOOK: 1. J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theo ry, Languages and Computations, second Edition, Pearson Education, 2007. REFERENCES: 1. H.R. Lewis and C.H. Papadimitriou, Elements of the theory of Computation, Second Edition, Pearson Education, 2003. 2. Thomas A. Sudkamp, An Introduction to the Theory of Computer Science, Languages and Machines, Third Edition, Pearson Education, 2007. 3. Raymond Greenlaw an H.James Hoover, Fundamentals of Theory of Computatio n, Principles and Practice, Morgan Kaufmann Publishers, 1998. 4. Micheal Sipser, Introduction of the Theory and Computation, Thomson Brokec ole, 1997. 5. J. Martin, Introduction to Languages and the Theory of computation Third Edition, Tata Mc Graw Hill, 2007 Topic No s UNIT I 1 T1(2-5) 2 3 3 4 5 6 7 9

Topic Name

Page No.

No.of Periods

Cumulative No.of Period

AUTOMATA Introduction to Automata R4 (31- 34), 1 1 Formal Proof & Additional forms of proof

T1 (5-31)

2 5 6 7 2

Finite Automata T1 (38 - 43) 1 4 Deterministic Finite Automata (DFA) T1 (45- 52) 1 Non-deterministic Finite Automata (NFA) T1 (56 - 59) 1 Conversions DFA to NFA & NFA to DFA T1 (60 - 65) 1 Finite Automata with Epsilon transitions. T1 (72-77)

8 Tutorial 3 12 UNIT II REGULAR EXPRESSIONS A ND LANGUAGES 9 Regular Expression T1 (83-88), R4(63-66) 2 14 10 FA and Regular Expressions T1 (90-101) 2 16 11 Proving languages not to be regular T1 (126-129) 1 17 12 Closure properties of regular languages T1 (131-145) 2 19 13 Equivalence and minimization of Automata T1 (154-164) 2 21 14 Tutorial 3 24 UNIT III CONTEXT-FREE GRAMMAR AND LANGUAGES 15 Context-Free Grammar (CFG) T1 ( 169-179), R4(101-110) 1 25 16 Parse Trees T1 (181-191) 1 26 17 Ambiguity in grammars and languages T1 (205-215) 2 28 18 Definition of the Pushdown automata T1 (219-228) 2 30 19 Languages of a Pushdown Automata T1 (229-236) 1 31 20 Equivalence of Pushdown automata and CFG, Deterministic Pushdown Automat a T1 (237-251) 2 33 21 Tutorial 3 36 UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 22 Normal forms for CFG T1 (255-269) 2 38 23 Pumping Lemma for CFL T1 (274-280) 1 39 24 Closure Properties of CFL T1 (281-291) 2 41 25 Turing Machines T1 (316-328) 2 43 26 Programming Techniques for TM T1 (329-334) 2 45 27 Tutorial 3 48 UNIT V UNDECIDABILITY 28 A language that is not Recursively Enumerable (RE) T1 (368-372) 1 49 29 An undecidable problem that is RE T1 (373-381) 2 51 30 Undecidable problems about Turing Machine T1 ( 383-390) 2 53 31 Posts Correspondence Problem T1 (392-397) 2 55 32 The classes P and NP. T1 (414-426) 2 57 33 Tutorial 3 60