Scribd
Upload
1 views

Toc OverView

The document outlines the syllabus for a Theory of Computation course (ETCS-206), detailing the content to be covered over 14 weeks with a total of 42 lectures. Key topics include finite automata, context-free grammars, Turing machines, and complexity classes. It also lists recommended textbooks and reference materials for further study.

Uploaded by

navneetsingharora22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Toc OverView

The document outlines the syllabus for a Theory of Computation course (ETCS-206), detailing the content to be covered over 14 weeks with a total of 42 lectures. Key topics include finite automata, context-free grammars, Turing machines, and complexity classes. It also lists recommended textbooks and reference materials for further study.

Uploaded by

navneetsingharora22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Theory of Computation

Paper Code: ETCS-206


Credits: 4
Total teaching weeks in semester: 14
Total lecture classes available: 42

S.No. Contents No. of Lectures


First Term
Unit -I
1. Overview: Alphabets, Strings & Languages, Chomsky 2
Classification of Languages
2. Finite Automata,Deterministic finite Automata (DFA) & 4
Nondeterministic finite Automata (NDFA), Equivalence of
NDFA and DFA,Minimization of Finite Automata.
3. Moore and Mealy machine and their equivalence. 2
4. Regular expression and Kleen’sTheorem(with proof), Closure 3
properties of Regular Languages.
5. Pumping Lemma for regular Languages(with proof). 2
Unit -II
6. Context free grammar, Derivation trees, Ambiguity in grammar 2
and its removal, Simplification of Context Free grammar.
7. Chomsky Normal Form &Greibach Normal Form. 2
8. Pumping Lemma for Context Free languages,Closure properties 2
of CFL(proof).
Second Term
9. Push Down Automata (PDA), Deterministic PDA, Non 3
Deterministic PDA ,Equivalence of PDA and CFG.
10. Overview of LEX and YACC. 2
Unit -III
11. Turing machines, Computing Partial Function with Turing 2
Machine.
12. Variants and equivalence of Turing Machine. 2
13. Nondeterministic Turing Machines, Universal Turing Machine. 2
14. Church’s Thesis. 2
15. Recursive and recursively enumerable languages. 2
16. Halting problem, Undecidability, Examples of Undecidable 2
problem.
Unit -IV
17. Introduction to Complexity classes, Computability and 2
Intractability, time complexity.
Third Term
18. P, NP, Co-NP, Proof of Cook’s Theorem, Space Complexity, 4
SPACE, PSPACE, Proof of Savitch’s Theorem, L ,NL ,Co-NL
complexity classes.
Text Books:
[T1] Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D “Introduction to Automata Theory,
Languages, and Computation”, Third Edition, Pearson.
[T2] Sipser, Michael, ”Introduction to the theory of Computation”, Third Edition, Cengage.

References Books:
[R1] Martin J. C., “Introduction to Languages and Theory of Computations”, Third Edition, TMH.
[R2] Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI.
[R3] Daniel I.A. Cohen, ”Introduction to Computer Theory”,Second Edition, John Wiley.

You might also like