Course Code: CSL0516

Course Name: Theory of Computation Semester: V

Credits L T P Contact Hours (per week) Independent Study Hours (per week) Section (Group)
04 3 1 0 04 08 B. Tech. (CSE)

Objective(s): This course aims to provide student with a comprehensive background in underlying concepts
and techniques used in Theory of Computation.

Course Module Details

Prerequisites The students should have basic knowledge of computing and mathematical concepts.
Course Unit – 1
Contents Introduction of Automata Theory, Basic Concepts of Finite State System, Types of Finite
Automata: Deterministic Finite Automata (DFA), Non Deterministic Finite Automata
(NDFA). Conversion of NDFA to DFA, Minimization of Automata Machines.

Unit – 2
Moore machines and Mealy machines, Conversion from Mealy to Moore and vice versa,
Two Way DFA. Regular Expression, Arden’s Theorem. Relationship between Regular
Expression and Finite Automata.

Unit – 3
Grammar and Languages, Types of Grammar: Regular Grammar, Context Free Grammar,
Context Sensitive Grammar. Derivation trees, Ambiguity in Grammar, Simplification of
Context Free Grammar, Conversion of Grammar to Automata Machine and vice versa,
Chomsky Hierarchy of Grammar, Killing Null and Unit productions. Chomsky Normal
Form and Greibach Normal Form.

Unit – 4
Push Down Automata (PDA), Example of PDA, Deterministic and Don-deterministic PDA,
Conversion of PDA into Context Free grammar and vice versa, Parsing and their Types.

Unit – 5
Turing Machine (TM), Language Acceptability, Techniques for Construction of TM.
Universal Turing Machine Multitape, Multihead and Multidimensional Turing Machine.
Introduction of undecideability. NP Complete problems.

Learning After successful completion of this course, students would be able to:
Outcomes  acquire a full understanding of automata theory;

 have a clear understanding of grammars, DFA, NFA PDA and TM;

 designing and minimization of automata and grammars.

Contact (Head)
Details Department of Computer Science & Engineering / Computer Applications
School of Engineering and Technology
ITM University, Gwalior
Email: hodcsit@itmuniversity.ac.in

Courseware and Reference Books

Text Books
 K. L. P. Mishra, N. Chandrasekaran; Theory of Computer Science: Automata, Languages and Computation; PHI
Learning.
 Harry R. Lewis, Christos H. Papadimitriou; Elements of the Theory of Computation; Prentice-Hall International.

References
 J. E. Hopcroft, R. Motwani, J. D. Ullman; Introduction to Automata Theory, Language , and Computation;
Pearson.
 Derrick Wood; The Theory of Computation. Wiley.
 Daniel I. A. Cohen; Introduction to Computer Theory; Wiley India.
 Michael Sipser; Introduction to Theory of Computation; Cengage Learning.