Professional Documents
Culture Documents
Cs6503 Theory of Computation Lesson Plan
Cs6503 Theory of Computation Lesson Plan
Cs6503 Theory of Computation Lesson Plan
: Appasami G.
Branch/Semester
: CSE / V
S.
No
.
Proposed
Dates
Date
Ho
Portions Covered
urs
Actual
Date of
Completi
on
Book Referred
with Pages
Book
Page
No.
No.
T1
3
4
5
1
1
1
T1
T1
T1
T1
T1
T1
37
45
72
83
60
96
T1
T1
159
T1
T1
T1
T1
T1
T1
169
171
173
181
255
T1
T1
T1
255
266
268
T1
T1
T1
T1
T1
T1
T1
T1
219
221
223
224
246
249
274
276
126
UNIT II GRAMMARS
1
2
3
4
5
1
1
1
1
1
7
8
9
1
1
1
256
1
1
1
1
1
1
1
2
Pushdown Automata
Definitions
Moves
Instantaneous descriptions
Deterministic pushdown automata
Equivalence of PDA and CFL
Pumping lemma for CFL
Problems based on pumping Lemma
UNIT V TURING MACHINES
1
2
3
4
5
6
7
8
9
1
1
1
1
1
1
1
1
1
T2
T2
T2
T2
T2
T2
T2
T2
T2
319
332
328
337
377
411
416
430
380
T2
T2
T2
T2
T2
T2
T2
T2
T2
407
442
365
347
481
500
502
506
508
1
1
1
1
1
1
1
1
1
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