Page 53 - B.E CSE Curriculum and Syllabus R2017 - REC

Department of CSE, REC

2. Jean Dollimore, Tim Kindberg, George Coulouris, Distributed Systems -Concepts and Design,
Pearson Education, Fourth edition, 2005.
3. M.L. Liu Distributed Computing Principles and Applications, Pearson Education, First edition, 2004.
4. Hagit Attiya and Jennifer Welch Distributed Computing: Fundamentals, Simulations and Advanced
Topics, Wiley, First edition, 2004.

CS17502 THEORY OF COMPUTATION L T P C
3 0 0 3
OBJECTIVES:
● To understand various Computing models like Finite State Machine, Pushdown Automata and Turing
Machine.
● To be aware of Decidability and Undecidability of various problems.
● To learn types of grammars.

UNIT I FINITE AUTOMATA 9
Introduction to formal proof – Additional forms of proof – Inductive proofs – Finite Automata (FA) –
Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with €
transitions - Equivalence of NFA and DFA – Equivalence of NDFA’s with and without €- moves.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9
Regular Expression – FA and Regular Expressions – Finite Automata to Regular Expression – Regular
Expression to Finite Automata – Proving languages not to be regular – Equivalence and minimization of
Finite Automata.

UNIT III GRAMMARS AND PUSHDOWN AUTOMATA 9
Grammar Introduction – Context Free Grammars and Languages – Derivation and Derivation Trees –
Ambiguity – Simplification of CFG – Normal Forms: CNF, GNF - Pushdown Automata - Instantaneous
descriptions – Design of pushdown automata – Equivalence of Pushdown automata and CFL - Pumping
lemma for CFL.

UNIT IV TURING MACHINES 9
Definitions of Turing machines – Programming Techniques for Turing machine construction – Multi head and
Multi tape Turing Machines - Problems about Turing machine - Chomskian hierarchy of languages.

UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS 9
Recursive and recursively enumerable languages – Diagonal Languages - Universal Turing machine – Code
for Turing Machine - Halting problem – Post Correspondence Problem (PCP) – The class P and NP.
TOTAL: 45 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to:
● Design Finite state machine.
● Construct and derive language generated by the CFG.
● Design Pushdown Automata.
● Design Turing Machine and recognize various types of grammars.
● Explain the Decidability or Undecidability of various problems.

TEXT BOOKS:
1. Hopcroft J.E., Motwani R. and Ullman J.D, Introduction to Automata Theory, Languages and
Computations, Second Edition, Pearson Education, 2008.
2. John C Martin, Introduction to Languages and the Theory of Computation, Third Edition, Tata
McGraw Hill Publishing Company, New Delhi, 2007.

Curriculum and Syllabus | B.E. Computer Science and Engineering | R2017 Page 53