THEORY OF COMPUTATIONS L T P C

20AI403 3 0 0 3
(Common to CSE and AI&DS)
Nature of Course Professional Core
Prerequisites Nil

Course Objectives
The course is intended to
1. Perceive Automata theory and the language hierarchy
2. Learn the concept of automata for any given pattern
3. Enhance the knowledge on a context free grammar for any given language
4. Acquire knowledge on programming techniques of a Turing machines
5. Incorporate the concept of undecidable problems and NP class problems

Course Outcomes
On successful completion of the course, students will be able to
Bloom's
CO. No. Course Outcome
Level
CO1. Design Automata for accepting or generating certain languages Apply
CO2. Interpret automata and regular expression for any pattern Apply
CO3. Formulate Context free grammar and pushdown automata Apply
Analyze the use of Turing Machine and properties of context free
CO4. Analyze
grammar
CO5. Analyze the decidability and undesirability of various problem Analyze
CO6 Analyze the polynomial problems Analyze

Course Contents:

Unit - I Automata Fundamentals 9

Introduction to formal proof – Inductive Proofs– Finite Automata – Deterministic Finite
Automata – Non-deterministic Finite Automata – Finite Automata with Epsilon Transitions,
Equivalence of NFA and DFA-Equivalence of NFAs with and without episilon moves,
conversions of NFA to DFA

Unit - II Regular Expressions and Languages 9

Regular Expressions – FA and Regular Expressions – E q u i v a l e n c e o f F A a n d r e g u l a r
e x p r e s s i o n - Proving Languages not to be regular – Closure Properties of Regular Languages
– Minimization of Automata - Applications of Regular Expressions.

Unit - III Context Free Grammar and Push Down Automata 9

Types of grammar-CFG – Parse Trees – Ambiguity in Grammars and Languages – P u s h
Down Automata(PDA): Definition- instantaneous description-
Languages of a Pushdown Automata – Equivalence of Pushdown Automata and CFG-CFG to PDA-
PDA to CFG

Unit – IV Normal Forms and Turing Machines 9

Normal Forms for CFG – simplifications of CFG- Chomsky Normal Form (CNF) and Greibach Normal
Form (GNF)- Pumping Lemma for CFL – Closure Properties of CFL – Turing Machine: definition and
representation-Language acceptance by Turing Machine.

Unit - V Undecidability 9
Non-Recursive Enumerable (RE) Language – Undecidable Problem with RE – Undecidable
Problems about TM – Post‘s Correspondence Problem-The Class P and NP- Kruskal’s algorithm-
Travelling Salesman problem
Total :45 Periods
Text Books:
1. Hopcroft J.E, Motwani and Ullman.D, “Introduction to Automata Theory, Languages and
Computations”, Pearson Education, 3rd Edition 2017.
2. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Learning,3rd Edition
2018.
Reference Books:
1. Lewis H.R and Papadimitriou C.H, “Elements of the theory of Computation”, Prentice-Hall of
India Pvt. Ltd, 2nd Edition 2015.

2. Martin.J, “Introduction to Languages and the Theory of Computation”, Tata Mc Graw Hill,
New Delhi, 3rd Edition 2020.
3. Kamala Krithivasan and Rama.R, “Introduction to Formal Languages Automata
Theory and Computation”, Pearson Education, 3rd Edition 2018.

Additional References:
1. https://nptel.ac.in/courses/111/103/111103016/
2. https://nptel.ac.in/courses/106/106/106106049/
3. https://www.digimat.in/nptel/courses/video/111103016/L01.html

Mapping of Course Outcomes (COs) with Programme Outcomes (POs) Programme Specific
Outcomes (PSOs)
Pos PSOs
Cos 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 3 3 3 2
CO2 3 3 3 3 3 2
CO3 3 3 3 3 3 2
CO4 3 3 3 3 3 2
CO5 3 3 3 3 3 2
CO6 3 3 3 3 3 2
3 High 2 Medium 1 Low

Formative assessment
Bloom’s Assessment Component Marks Total
Level marks
Remember Online Quiz 5
Understand Tutorial Class / Assignment 5 15
Attendance 5

Summative Assessment
Internal Assessment Examinations Terminal Examination
Bloom’s Category
IAE – I (5) IAE – II (10) IAE – III (10) (60)
Remember 10 10 0 20
Understand 20 20 10 20
Apply 10 10 20 40
Analyze 10 10 20 20
Evaluate
Create