RAJALAKSHMI ENGINEERING COLLEGE

Thandalam, Chennai – 602 105 LESSON PLAN

Faculty Name Subject Name Year Degree & Branch

: : : :

BENEDICT JAYAPRAKASH NICHOLAS THEORY OF COMPUTATION III B.E. – C.S.E.

Staff Code Subject Code Semester Section

: : : :

CS40 CS1303 V A

Aim:  To have an introductory knowledge of automata, formal language theory and computability. 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 their corresponding recognizers.  To study the Turing Machine and classes of problems. Text Book(s): 1. J.E.Hopcroft, R.Motwani and J.D Ullman,“Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2003. Reference Book(s): 1. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH, 2003. 2. H.R.Lewis and C.H.Papadimitriou, “Elements of The Theory of Computation”, Second Edition,Pearson Education/PHI, 2003. 3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997. 4. J.E. Hopcroft and J.D Ullman, “Introduction to Automata Theory, Languages and Computations, Narosa. Sl. No. 1 2 T / R* Book T Book No. 1

Date 18-06-2008

Period I

Unit I I

Topic(s) Introduction to TOC Finite Automaton

Page(s) 25-30

Signature of Faculty 1

Signature of HOD

Sl. No. 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

Date

Period

Unit I I I I I I I I I I I I I II II II II II II

Topic(s) Deterministic Finite Automaton Problems on DFA Problems on DFA Non-deterministic FA Problems on NFA Problems on NFA Equivalence of NFA & DFA Conversion of NFA to DFA FA with Epsilon Transitions Equivalence of NFA with & without Epsilon moves Problems on Conversion of NFA’s to DFA’s Introduction to formal proofs Additional forms of proofs Regular Expressions Equivalence of FA & regular expressions Equivalence of FA & regular expressions Problems on conversion of regular expression to NFA Problems on conversion of DFA to regular expression Pumping Lemma

T / R* Book

Book No.

Page(s)

Signature of Faculty 2

Signature of HOD

Sl. No. 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41

Date

Period

Unit II II II II II II III III III III III III III III III III III III III III

Topic(s) Problems on Pumping Lemma Closure properties of regular sets Closure properties of regular sets Equivalence & Minimization of Automata Equivalence & Minimization of Automata Problems on Minimization Context Free Grammars Derivation Trees Problems on design of CFG Problems on design of CFG Parse Trees Ambiguity in grammars Push down Automata The languages of a PDA The languages of a PDA Problems on PDA Problems on PDA Equivalence of PDA & CFG Problems on conversion of PDA To CFG & vice-versa Problems on conversion of PDA To CFG & vice-versa

T / R* Book

Book No.

Page(s)

Signature of Faculty 3

Signature of HOD

Sl. No. 42 43 44 45

Date

Period

Unit III IV IV IV IV IV IV IV IV IV IV V V V V V V V

Topic(s) Deterministic PDA Normal forms for CFG Problems on CNF Pumping Lemma for CFL Closure properties of CFL Closure properties of CFL Turing Machines Transition Diagrams for TM Problems on TM Problems on TM TM Programming techniques Recursively Enumerable Lang. Undecidable problems Undecidable problems Undecidable problems & TM Rice Theorems Post Correspondence Problem The classes P and NP

T / R* Book

Book No.

Page(s)

* T  Text Book / R  Reference Book

Signature of Faculty 4

Signature of HOD

Sign up to vote on this title
UsefulNot useful