Date: 31.08.

2017

Core course-XII Theory of Computation

Sr. No. Topic Chapter Reference # of
Lecture
1. Languages: Alphabets, String, 2 [1]
language, Basic operations on
5
language, Concatenation, Kleene
Star
2. Regular Languages :
(a) Regular Expressions 4 [1]
(b) DFA 5 [1]
Concepts of TGs and GTGs 6 [1]
(c) Kleenes Theorem 7 (excluding Proof 2, Theorem [1]
6, Part 3, Rule 1 & 2) 20

(d) Regular languages 9 [1]

(e) Pumping theorem 10 (Definition: Regular [1]
languages, Theorem 13 and 14
with examples )
3. Context Free languages:
(a) Context free grammars 12 [1]
(b) Normal forms 7.1 [3]
(c) Pushdown automata 14 [1]
(d) Pumping Theorem 16 Theorem 34 [1] 20
Theorem 35 or
7.2.2 [3]
(e) Properties of Context 7.3 [3]
free languages
4. Models of Computation :
(a) RAM, TM Chp.4 till 4.5 [2]
And 4.7 (Intro. only)

(b) UTM, Language acceptability 9.1, 9.2, 9.3.1-9.3.2 [3]

15
decidability, insolvability
problems, Recursive
enumerable and Recursive
Languages.

References:

1. Daniel I.A. Cohen, Introduction to computer theory John Wiley (1996 2nd Edition).
2. Harry R. Lewis, Christos H. Papadimitriou, Elements of the theory of computation 2nd Edition PHI
1997.
3. John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman, Introduction to Automata theory, Languages,
& Computation 3rd Edition 2008, Pearson Education.