DOC/LP/01/28.02.02
LP-CS2303
LESSON PLAN
LP: Rev. No: 01
Date: 25-06-2012
Sub Code & Name : CS2303- THEORY OF COMPUTATION
Page 1
Unit : I
Branch : CS
of 6
Semester : V
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.
Objective: This Unit introduces about the different types of formal proof and about Finite
Automata. It also gives a deep insight about the Deterministic Finite Automata and the Nondeterministic Finite Automata with and without Epsilon transitions with theorems.
Session
No
1
2
3
4
5
6,7
8,9
10
11,12
Topics to be covered
Time in
min
50
Ref
T1
Teaching
Method
BB
50
T1
BB
50
T1
BB
50
T1
BB
50
T1
BB
100
T1
BB
Non-deterministic Finite Automata – Definition,
Transition Function, Languages of NFA, Equivalence of
NFA and DFA and problems
Finite Automata with Epsilon transitions – Uses,
Notation, Epsilon-closures, Extended transitions
and languages
100
T1
BB
50
T1
BB
Eliminating Epsilon-Transitions, Theorem and
problems
100
T1
BB
Introduction to Theory of Computation and
Automata Theory
Introduction to formal proof – Deductive Proof,
Reduction to Definitions, Other forms, Not to be Ifthen statements
Additional forms of proof – Proving equivalence
about sets, Contrapositive, Proof by Contradiction,
Counterexamples
Inductive Proofs – Induction on Integers,
Structural Forms, Mutual Induction
Central Concepts of Automata Theory, Informal
Picture of Finite Automata
Deterministic finite Automata – Definitions,
Processing Strings, Notations, Transition Functions,
Languages of DFA and problems
DOC/LP/01/28.02.02
LP-CS2303
LESSON PLAN
LP: Rev. No: 01
Sub Code & Name : CS2303- THEORY OF COMPUTATION
Date: 25-06-2012
Page 2
Unit : II
Branch : CS
of 6
Semester : V
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.
Objective: This Unit introduces Regular Expressions and Conversion of RE to DFA and vice-versa.
It also explains about how to prove a language not to be a regular language. Finally it deals with
testing equivalence of regular languages and Minimization of DFA’s.
Session
No
13
14,15
16,17
18,19
20
21
22
23,24
Topics to be covered
Time in
min
Ref
Teaching
Method
Regular Expression – Introduction, Building RE,
Precedence of Regular Expression operators
50
T1
BB
Finite Automata & Regular Expressions –
Converting DFA to RE and problems
Converting RE to DFA and problems
100
T1
BB
100
T1
BB
Proving Languages not to be Regular – Pumping
Lemma and its Applications and problems
100
T1
BB
Closure properties of regular Languages
Closure properties of regular Languages
Testing Equivalence of sets and states
Minimization of Automata and problems
CAT I
50
50
50
100
75
T1
T1
T1
T1
BB
BB
BB
BB
DOC/LP/01/28.02.02
LP-CS2303
LESSON PLAN
LP: Rev. No: 01
Sub Code & Name : CS2303- THEORY OF COMPUTATION
Date: 25-06-2012
Page 3
Unit : III
Branch : CS
of 6
Semester : V
UNIT III – CONTEXT FREE GRAMMARS 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.
Objective: This Unit introduces Context Free Grammar and Parse Tree. It also deals with ambiguity
in grammars and language. It also introduces Pushdown Automata and its languages and its
equivalence with CFG.
Session
No
25,26
Time in
min
100
Ref
T1
Teaching
Method
BB
100
T1
BB
29,30
Parse trees – construction, Yield, Inference,
Derivations and problems
Ambiguity in Grammars and Languages –
Ambiguous Grammars, Removing Ambiguity,
Inherent Ambiguity and problems
100
T1
BB
30,31
Pushdown Automata – Definition, Graphical
notation, Instantaneous Descriptions and problems
100
T1
BB
32
Languages of a PDA – Acceptance by Final state
and empty stack, empty stack to final state & vice
versa
50
T1
BB
33
34,35
Equivalence of PDA’s and CFG’s
Deterministic Pushdown Automata – Definition,
DPDA’s and Regular Languages & CFL’s and
problems
50
100
T1
T1
BB
BB
27,28
Topics to be covered
Context Free Grammars – Informal example,
Definition, Derivations, Language of a Grammar
and problems
DOC/LP/01/28.02.02
LP-CS2303
LESSON PLAN
LP: Rev. No: 01
Date: 25-06-2012
Sub Code & Name : CS2303- THEORY OF COMPUTATION
Unit : IV
Branch : CS
Page 4
Semester : V
UNIT IV – PROPERTIES OF CONTEXT-FREE LANGUAGES
of 6
9
Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines –
Programming Techniques for TM.
Objective: This Unit introduces the various Normal forms for CFG and also deals with Pumping
Lemma for Context Free Languages and its closure properties. It also gives in depth knowledge
about Turing Machine and its Programming Techniques.
Session
No
36
37
38
39
40,41
42
43
44
45,46
47
48
Topics to be covered
Normal forms for CFG-Eliminating Useless
Symbols, Eliminating epsilon productions and
problems
Eliminating Unit productions and Chomsky
Normal forms and problems
Pumping Lemma for CFL-Statement and
Applications
Closure properties of CFL
Introduction to Turing Machine-Notation,
Instantaneous Descriptions and Transition
diagram and problem
Programming Techniques for TM-Storage in the
State
Programming Techniques for TM-Multiple
Tracks
Programming Techniques for TM-Subroutines
Problems on Programming Techniques for TM
Extensions of Basic TM
Non-deterministic TM
CAT II
Time in
min
50
Ref
T1
Teaching
Method
BB
50
T1
BB
50
T1
BB
50
50
T1
T1
BB
BB
50
T1
BB
50
T1
BB
50
100
50
50
75
T1
T1
T1
T1
BB
BB
BB
BB
DOC/LP/01/28.02.02
LP-CS2303
LESSON PLAN
LP: Rev. No: 01
Date: 25-06-2012
Sub Code & Name : CS2303- THEORY OF COMPUTATION
Page 5
Unit : V
Branch : CS
of 6
Semester : V
UNIT V – UNDECIDABILITY
9
A language that is not Recursively Enumerable (RE) –An undecidable problem that is REUndecidable problems about Turing Machine – Post’s Correspondence Problem –The classes P and
NP.
Objective: This Unit introduces Recursive and Recursively Enumerable Languages. It also
introduces about Decidable and Undecidable Problems, Undecidable Problems that is Recursively
Enumerable, Undecidable problems about TM. It also introduces Post’s Correspondence Problem
and The classes P and NP.
Session
Topics to be covered
Time in
Ref
Teaching
No
min
Method
49
A language that is not Recursively Enumerable –
50
T1
BB
Coding for TM, Diagonalization Language
50
51
52
53
54
55
56
57
58
59
60
An undecidable problem that is RE – Recursive
Languages, Complements
Universal Language, Undeciadability of
Universal Language
Undecidable problems about Turing Machine –
Reductions
TM accepting Empty Language
Rice’s Theorem and Properties of the RE
Languages
Post’s Correspondence Problem – Definition and
problems
Modified PCP and problems
The Classes of P and NP – Problems solvable in
Polynomial Time with examples
Nondeterministic Polynomial Time with
examples
Polynomial-Time Reductions
NP-complete problems
CAT III
50
T1
BB
50
T1
BB
50
T1
BB
50
T1
BB
50
T1
BB
50
50
T1
T1
BB
BB
50
T1
BB
50
50
75
T1
T1
BB
BB
DOC/LP/01/28.02.02
LP-CS2303
LESSON PLAN
LP: Rev. No: 01
Date: 25-06-2012
Sub Code & Name : CS2303- THEORY OF COMPUTATION
Page 6 of 6
Branch : CS
Semester : V
Course Delivery Plan
Week
Units
1
2
3
4
5
6
7
8
9
10
11
I II
I II
I II
I II
I II
I II
I II
I II
I II
I II
I II
12
13
14
15
I
I
I
I
II
II
II
II
1 1 1 1 1 1 2 2 2 2 2 2 3 3 3 3 3 3 4 4 4 4 4 4 5 5 5 5 5 5
BOOKS FOR STUDY
TEXT BOOKS
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages and
Computations”, second Edition, Pearson Education, 2007.
REFERNCES
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 Computation, Principles
and Practice”, Morgan Kaufmann Publishers, 1998.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.
5. J. Martin, “Introduction to Languages and the Theory of computation” Third Edition, Tata Mc
Graw Hill, 2007
Prepared by
Approved by
Signature
Name &
Designation
Date
Dr. Susan Elias / Professor
Ms. G.Janakasudha / AP
02-07-2012
Dr.T.K.Thivakaran
Head, Department of CS