This document contains a lesson plan for the subject "Theory of Computation" taught to 5th semester Computer Science students. The lesson plan spans 9 weeks and covers 5 units - Finite Automata, Grammars, Pushdown Automata, Turing Machines, and Unsolvable Problems. It lists the topics to be covered in each class, the relevant textbook chapters and pages, and the faculty member responsible for teaching the subject. The lesson plan provides a comprehensive overview of the topics, readings, and schedule for the Theory of Computation course.

1. DR.PAULS ENGINEERING COLLEGE
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
LESSON PLAN
Name of the Faculty : Appasami G. Designation: Asst. Professor
Branch/Semester : CSE / V Academic Year: 2016 - 17
Subject Code and Name : CS6503 - THEORY OF COMPUTATION
S.
No
.
Proposed
Dates
Portions Covered
Actual
Date of
Completi
on
Book Referred
with Pages
Date
Ho
urs
Book
No.
Page
No.
UNIT I FINITE AUTOMATA
1 1
Introduction - Basic Mathematical Notation and
techniques
T1 2
2 1
Finite State systems - Basic Definitions
Finite Automaton
T1
37
3 1 DFA & NDFA T1 45
4 1 Finite Automaton with ε- moves T1 72
5 1 Regular Languages - Regular Expression T1 83
6 1
Equivalence of NFA and DFA
Equivalence of NDFA’s with and without ε - moves
T1
60
7 1
Equivalence of finite Automaton and regular
expressions
T1
96
8 1 Minimization of DFA T1 159
9 1
Pumping Lemma for Regular sets
Problems based on Pumping Lemma
T1
126
UNIT II GRAMMARS
1 1 Grammar Introduction - Types of Grammar T1 169
2 1 Context Free Grammars and Languages T1 171
3 1 Derivations and Languages Ambiguity T1 173
4 1 Relationship between derivation and derivation trees T1 181
5 1 Simplification of CFG T1 255
6 1
Elimination of Useless symbols
Unit productions - Null productions
T1
256
7 1 Greiback Normal form T1 255
8 1 Chomsky normal form T1 266
9 1 Problems related to CNF and GNF T1 268
UNIT III PUSHDOWN AUTOMATA
1 1 Pushdown Automata T1 219
2 1 Definitions T1 221
3 1 Moves T1 223
4 1 Instantaneous descriptions T1 224
5 1 Deterministic pushdown automata T1 246
6 1 Equivalence of PDA and CFL T1 249
7 1 Pumping lemma for CFL T1 274
8 2 Problems based on pumping Lemma T1 276
UNIT V TURING MACHINES

2. 1 1 Definitions of Turing machines T2 319
2 1 Models T2 332
3 1 Computable languages and functions T2 328
4 1 Techniques for Turing machine Construction T2 337
5 1 Multi head and Multi tape Turing Machines T2 377
6 1 The Halting problem T2 411
7 1 Partial Solvability T2 416
8 1 Problems about Turing machine T2 430
9 1 Chomskian hierarchy of languages T2 380
UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS
1 1 Unsolvable Problems and Computable Functions T2 407
2 1 Primitive recursive functions T2 442
3 1 Recursive and recursively enumerable languages T2 365
4 1 Universal Turing machine. T2 347
5 1 Measuring and classifying complexity T2 481
6 1 Tractable and Intractable problems T2 500
7 1 Tractable and possibly intractable problems T2 502
8 1 P and NP completeness T2 506
9 1 Polynomial time reductions T2 508
TEXT BOOKS:
1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory,
Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT
1,2,3)
2. John C Martin, “Introduction to Languages and the Theory of Computation”, Third
Edition, Tata McGraw Hill Publishing Company, New Delhi, 2007. (UNIT 4,5)
REFERENCES:
1. Mishra K L P and Chandrasekaran N, “Theory of Computer Science - Automata,
Languages and Computation”, Third Edition, Prentice Hall of India, 2004.
2. Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of
Computation”, Second Edition, Prentice Hall of India, Pearson Education, New
Delhi, 2003.
3. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition,
Narosa Publishers, New Delhi, 2002.
4. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata
Theory and Computation”, Pearson Education 2009
Faculty In charge HOD Dean / Principal