SRM UNIVERSITY

FACULTY OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
COURSE PLAN

Course Code : CS1013

Course Title : Theory of Computation
Semester : IV
Course Time : July2017-Dec 2017
Session Details
SECTION DAY ORDER PERIOD TIMINGS
2 6,7 12.30-2.15pm
Group - I 4 8 2.20-3.10pm
5 4 10.40-11.30am
2 1,2 8.00-9.40am
Group - II 4 3 9.45-10.35am
5 9 3.15-4.05pm

Location:S.R.M.E.C-Tech Park
Faculty Details

Group Name OFFICE OFFICE HOURS Mail id

Monday to Friday
R. Anitha TP 603A anitha.r@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
Monday to Friday
R. Srinivasan UB813 Srinivasan.r@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
Monday to Friday
C.Jothikumar TP708B jothikumar.c@ktr.srmu iv.ac.in
8.00 AM to 4.05 PM
Monday to Friday
I J.V.Vidhya TP803 vidhya.j@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
Monday to Friday
R. Deeba TP806A deeba.k@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
Monday to Friday
S. Girija TP003A girija.s@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
A.Nithya Monday to Friday
TP003A nithyakalyani.a@ktr.srmuniv.ac.in
Kalyani 8.00 AM to 4.05 PM
Monday to Friday
S.Sharanya UB813 sharanya.s@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
Monday to Friday
R.Brindha UB820 brindha.r@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
K.Senthil Monday to Friday
TP703A senthilkumar.k@ktr.srmuniv.ac.in
Kumar 8.00 AM to 4.05 PM
Monday to Friday
P. Saranya TP803A saranya.p@ktr.srmuniv.ac.in
II 8.00 AM to 4.05 PM
Monday to Friday
S. Usha Sukanya TP003A
8.00 AM to 4.05 PM ushasukhanya.s@ktr.srmuniv.ac.in
Monday to Friday
S. Selva Kumar TP706A selvakumar.s@ktr.srmuniv.ac.in
8.00 AM to 4.05 PM
Dr.R. Annie Monday to Friday
TP808B annie.u@ktr.srmuniv.ac.in
Uthra 8.00 AM to 4.05 PM
TEXT BOOK
1. E.Hopcroft and J.D.Ullman, “Introduction to Automata Theory, Languages and Computation”,
Pearson, Education Publishers, 2nd Edition, 2004

REFERENCE BOOKS
1. Michael Sipser, “Introduction to the Theory of Computation”, Thomson Asia, 2004
2. J.C.Martin, “Introduction to Languages and Theory of Computation”, McGraw Hill,2003
3. K.L.P. Mishra, N.Chandrasekaran , “ Theoretical Computer Science “, PHI, 3rd Edition, 2007

ONLINE REFE R EN C E S

http://www.cis.upenn.edu/~cis511/

http://en.wikipedia.org/wiki/Theory_of_comput ation

http://geisel.csl.uiuc.edu/~loui/sdcr/

http://www.math.niu.edu/~rusin/known-math/index/68QXX.html#INTRO

http://www.eecs.harvard.edu/theory/

http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk. html

Prerequisite : CS0202 – Principles of Programming Languages

Objectives
1. To study the concepts of Various languages
2. To learn about the various computing devices like FSM,PDA,Turing machines
3. To learn the various computability concepts

Assessment Details
Cycle Test – I : 15 Marks
Surprise Test – I : 5 Marks
Model Exam : 25 Marks
Assignment : 5 Marks
Test Schedule

S.No. DATE TEST TOPICS DURATION

1 As per schedule Cycle Test - I Unit I & II 2 periods
2 As per schedule Model Exam All 5 units 3 Hrs
Outcomes
Students who have successfully completed this course will have full understanding of the
following concepts
1. Various Complexity classes
2. Various ideas of NP COMPLETE,NP-HARD Problems
3.Various Computing Devices

Detailed Session Plan

FINITE AUTOMATA
Introduction - Basic Mathematical Notation and techniques- Finite State systems - Basic Definitions - Finite
Automaton - DFA & NDFA - Finite Automaton with € -moves - Regular Languages- Regular Expression - Equivalence
of NFA and DFA - Equivalence of NDFA's with and without € -moves - Equivalence of finite Automaton and regular
expressions -Minimization of DFA - Pumping Lemma for Regular sets - Problems based on Pumping Lemma.

Sessi Time Teaching

on Topics to be covered Ref Testing Method
(min) Method
No.
FINITE AUTOMATA Group discussion
1 50 1,2 BB Quiz
2 Introduction 50 1,2 BB Assignment/ practical
Basic Mathematical Notation and Assignment/ practical
3 50 1 BB
techniques
4 Finite State systems - Basic Definitions, 50 1 BB Assignment
Finite Automaton - DFA & NDFA, Finite Assignment/ practical
5 50 1 BB
Automaton with € -moves
Regular Languages- Regular Expression,, Quiz, Assignment
6 50 1 BB
Equivalence of NFA and DFA - Quiz, Assignment
7 Equivalence of NDFA's with and without 50 1 BB
€ -moves
Equivalence of finite Automaton and Assignment/ practical
50 1,3 BB
8 regular expressions
Minimization of DFA - Pumping Lemma Assignment/ practical
9 50 1,3 BB
for Regular sets

GRAMMARS
Grammar Introduction - Types of Grammar - Context Free Grammars and Languages- Derivations and Languages -
Ambiguity- Relationship between derivation and derivation trees - Simplification of CFG - Elimination of Useless
symbols - Unit productions - Null productions - Greiback Normal form - Chomsky normal form - Problems related to
CNF and GNF.

10 Grammar Introduction 50 1,2 BB Discussion

Types of Grammar - Context Free Illustration by examples
11 50 1,2 BB
Grammars and Languages
 Derivations and Languages Test
12 50 1 BB
Ambiguity- Relationship between Quiz
13 50 1 BB
derivation and derivation trees
14 Simplification of CFG 50 1 BB Quiz
Elimination of Useless symbols, Unit Assignment
15 50 1 BB
productions, Null productions
Greiback Normal form,CNF Problem solving,
16 50 1 BB
surprise test
Problems related to CNF and GNF. Problem solving,
17 50 1 BB
surprise test
PUSHDOWN AUTOMATA
Pushdown Automata - Definitions - Moves - Instantaneous descriptions - Deterministic pushdown automata -
Equivalence of Pushdown automata and CFL - pumping lemma for CFL - problems based on pumping Lemma
Pushdown Automata Quiz
18 50 1,2 BB Group discussion

Definitions - Moves Quiz

19 50 1,2 BB
Group discussion
Instantaneous descriptions Quiz
20 50 1 BB

21 Deterministic pushdown automata 50 1 BB Surprise Test

Equivalence of Pushdown automata and
22 50 1 BB Group discussion
CFL
Pumping lemma for CFL Quiz
23 50 1 BB

24 Problems based on pumping Lemma. 50 1 BB Group discussion

Pushdown Automata-More problems Test
25 50 1 BB
Brain storming
Pushdown Automata-More problems Test
26 50 1 BB
Brain storming
Pushdown Automata-More problems Test
27 50 1 BB
Brain storming
TURING MACHINE
Turing Machines- Introduction - Formal definition of Turing machines - Instantaneous descriptions- Turing Machine as
Acceptors - Turing Machine as Transducers Computable Languages and functions - Turing Machine constructions -
Modifications of Turing Machines.

Turing Machines Group discussion

28 50 1 BB
Assignment
Introduction - Formal definition of Turing Group discussion
29 50 1 BB
machines Quiz
Instantaneous descriptions Group discussion
30 50 1 BB
Assignment
Turing Machine as Acceptors Group discussion
31 50 1 BB
Assignment
Turing Machine as Transducers Group discussion,
32 50 1 BB
Computable Languages and functions Surprise test
Turing Machine constructions Group discussion,
33 50 1 BB Surprise test

,, Group discussion
34 50 1 BB

35 ,, 50 1 BB Surprise test
36 Modifications of Turing Machines. Quiz
50 1 BB
Group discussion
COMPUTATIONAL COMPLEXITY
Undecidability- Basic definitions- Decidable and undecidable problems - Properties of Recursive and Recursively
enumerable languages - Introduction to Computational Complexity: Definitions-Time and Space complexity of TMs -
complexity classes - introduction to NP-Hardness and NP-Completeness
37 Undecidability, Basic definitions 50 1 BB Group discussion
38 Decidable and undecidable problems 50 1 BB Group discussion
Properties of Recursive and Recursively
39 50 1 BB Group discussion
enumerable languages
Introduction to Computational
40 50 1 BB Group discussion
Complexity
Introduction to Computational Surprise test
41 50 1 BB
Complexity Group discussion
Definitions-Time and Space complexity
42 50 1 BB Assignment
of TMs
43 Complexity classes 50 1 BB Assignment
44 Complexity classes 50 1 BB Group discussion
Introduction to NP-Hardness and NP-
45 50 1 BB Group discussion
Completeness
• BB – Black Board
Prepared By
Staff Name : C. Jothikumar
Signature : HOD/CSE