DMI ENGNIEERING COLLEGE

Kumarapuram Road, Aralvaimozhi – 629 301

Department of Computer Science

and Engineering

COURSE PLAN
(Regulation 2021)

CS3452 THEORY OF COMPUTATION

Subject
Code&Name
Computer Science and Engineering
Programme

Year II & IV
&Semester

Nature of Theory Credits :3

Course / Credit

Name of the Mrs.A.Anorelin

faculty
 VISION AND MISSION OF THE INSTITUTE & DEPARTMENT

Vision Mission

To emerge as a “Centre for

excellence” offering Technical
Our mission defines the distinct ways we
Education and Research
think and work, as well as the impact that
Opportunities of very high
we expect it will have on the world.Our
standards to students, develop
mission is to produce creative and
Institute the total personality of the
technically strong engineers and to research
individual, and instill high levels
pioneering solutions to global challenges.
of discipline and strive to set
We do this with an unprecedented
global standards, making our
commitment to integrating across
students technologically superior
engineering, sciences, arts, business and
and ethically strong, who in turn
other disciplines to yield transformative
shall contribute to the
results.
advancement of society and
humankind.

To educate students to be 1. To Provide quality education in the

successful, ethical and effective ever changing field of Computer
Department problem solvers and life –long science and Engineering.
Learners who will contribute 2. To Provide a learning ambience to
positively to the economic well enhance innovations, problem
being of our nation. solving skills, leadership
qualities ,team–spirit and ethical
responsibilities.
COURSE DESCRIPTION: CS3452 THEORY OF COMPUTATION

1. SYLLABUS

Subject Name : Object Oriented Programming L T P C

3 0 0 3
Programme: Computer Science and Engineering Sem: III Category:
Prerequiste It is recommended that the candidate has done a course in Data Structures and Algorithms.
Fast Improvement: a result of focusing all attention on one critical area – the system
Aim:
constraint. Improved Capacity
Course Objectives:
1
To understand foundations of computation including automata theory

2 To construct models of regular expressions and languages.

3 To design context free grammar and push down automata
4 To understand Turing machines and their capability
5 To understand Undecidability and NP class problems

UNIT I AUTOMATA AND REGULAR EXPRESSIONS 9

Need for automata theory - Introduction to formal proof – Finite Automata (FA) – Deterministic
FiniteAutomata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA
and DFA– Finite Automata with Epsilon transitions – Equivalence of NFA and DFA-
Equivalence of NFAswith and without ε-moves- Conversion of NFA into DFA – Minimization
of DFAs.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9

Regular expression – Regular Languages- Equivalence of Finite Automata and regular

expressions– Proving languages to be not regular (Pumping Lemma) – Closure properties of
regular languages.

UNIT III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA 9

Types of Grammar - Chomsky‘s hierarchy of languages -Context-Free Grammar (CFG) and

Languages – Derivations and Parse trees – Ambiguity in grammars and languages – Push Down
Automata (PDA): Definition – Moves - Instantaneous descriptions -Languages of pushdown
automata – Equivalence of pushdown automata and CFG-CFG to PDA-PDA to CFG –
Deterministic Pushdown Automata.

UNIT IV NORMAL FORMS AND TURING MACHINES 9

Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and Greibach
NormalForm (GNF) – Pumping lemma for CFL – Closure properties of Context Free Languages
–TuringMachine : Basic model – definition and representation – Instantaneous Description –
 Languageacceptance by TM – TM as Computer of Integer functions – Programming techniques
for Turingmachines (subroutines).

UNIT V UNDECIDABILITY 9

Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and

recursivelyenumerable languages – Properties - Universal Turing machine -Tractable and
Intractable problems- P and NP completeness – Kruskal’s algorithm – Travelling Salesman
Problem- 3-CNF SAT problems.

2. Course Outcome (COs): (should follow Bloom’s taxonomy)

Course Outcomes: After successful completion of the course, the students should be able to

COs CO Statements Pos

Construct automata theory using PO 3,PO5,PO10,PO12
CO1: Finite Automata

Write regular expressions for any PO 3,PO5,PO10,PO12

CO2:
pattern
Design context free grammar and PO 3,PO5,PO10,PO12
CO3:
Pushdown Automata
Design Turing machine for PO 3,PO5,PO10,PO12
CO4:
computational functions
Differentiate between decidable and PO 3,PO5,PO10,PO12
CO5:
undecidable problems

3.Text Books & Reference Books

S. Text / Title of the Book Author/Publisher/ Web link

No Referenc Year/ Edition
. e book
"Introduction to Automata Hopcroft J.E., Motwani R. https://methodist.edu.in/
Theory, Languages and & Ullman J.D., web/uploads/files/
3rd Edition, Pearson Introduction%20To
1 Text Computations",
Education, 2008. %20Automata
%20Theory_john
%20hopcroft.pdf

2 Text John C Martin , 4th https://

"Introduction to
Edition, getpdfs.blogspot.com/
Languages and the Theory
 Tata McGraw Hill, 2011. 2020/12/introduction-to-
of Computation",
languages-and-theory-of.html
Harry R Lewis and https://www.u-cursos.cl/
Elements of the Theory of
Christos H Papadimitriou ingenieria/2010/2/
Computation
2nd CC3102/1/material_docente/
3 Reference Edition, Prentice Hall of bajar?id=322214
India, 2015.

Reference Peter Linz, 6th Edition,

An Introduction to Formal https://broman.dev/
Jones & Bartlett,2016. download/An
Language and Automata
%20Introduction%20to
4
%20Formal%20Languages
%20and%20Automata
%206th%20Edition.pdf
Reference K.L.P.Mishra and
“Theory of Computer https://www.amazon.in/
N.Chandrasekaran, , 3rd Theory-Computer-Science-
Science: Automata
5 Edition, Prentice Hall of Languages-Computation/dp/
Languages
India, 2006 8120329686
andComputation”

4. Web Resources: (other than NPTEL, SWAYAM and other e learning resources)

S.No. Topic Web link

1 FUNDAMENTALS OF https://www.tutorialspoint.com/what-are-the-
TOC fundamental-concepts-of-toc

2 THEORY OF https://en.wikipedia.org/wiki/Theory_of_constraints-
CONSTRAINTS

5. E – learning videos/NPTEL/ SWAYAM and other resources (IMPORTANT!)

1 THEORY OF https://onlinecouses.nptel.ac.in/noc23_cs70
COMPUTATION

6. Lesson Plan

Mode of
Text/
Hours teaching Page
S.no Unit Topic to be covered Ref.
need (BB/PPT/ no
book
Others)
UNIT I AUTOMATA AND REGULAR EXPRESSIONS
1. Need for automata theory 1
1 - Introduction to formal Blackboard T1 5
proof
2. Finite Automata (FA) – 1
2 Deterministic Blackboard T1 37
FiniteAutomata (DFA)
3. Non-deterministic Finite 1
Blackboard T1 55
3 Automata (NFA)
4. Equivalence between 1
Blackboard T1 60
NFA and DFA
I
5. Finite Automata with 2
Blackboard T1 72
4 Epsilon transitions
6. Equivalence of NFA and 1
Blackboard T1 55
5 DFA
7. Equivalence of 1
6 NFAswith and without ε- Blackboard T1 70
moves
8. Conversion of NFA into 1
Blackboard T1 75
7 DFA
9. Minimization of DFAs. 1
Blackboard T1 81
8
UNIT II REGULAR EXPRESSIONS AND LANGUAGES
1. Regular expression 1 Blackboard T1 83
2. Regular Languages 1 Blackboard T1 84
3. Equivalence of Finite T1
Automata and regular 2 Blackboard 90
expressions
4. II Proving languages to be T1
not regular (Pumping 3 Blackboard 126
Lemma)
5. Closure properties of T1
regular languages. 2 Blackboard 131

UNIT III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA

1. III Types of Grammar 1 Blackboard T1 169
1
2. Chomsky‘s hierarchy of
2 1 Blackboard T1 173
languages
3. Context-Free Grammar
3 1 Blackboard T1 177
(CFG) and Languages
4. Derivations and Parse
4 1 Blackboard T1 183
trees
5. Ambiguity in grammars
5 1 Blackboard T1 205
and languages
6. Push DownAutomata 1 Blackboard T1 219
6 (PDA): Definition –
Moves - Instantaneous
descriptions
7. Languages of pushdown
7 1 Blackboard T1 229
automata
8. Equivalence of
8 pushdown automata and
1 Blackboard T1 237
CFG-CFG to PDA-PDA
to CFG
9. Deterministic Pushdown
9 1 Blackboard T1 246
Automata
UNIT IV NORMAL FORMS AND TURING MACHINES
1. Normal forms for CFG 1 255
Blackboard T1
19
2.
Simplification of CFG 1 Blackboard T1 258
20
3. Chomsky Normal Form
21 (CNF) and Greibach 1 Blackboard T1 266
NormalForm (GNF)
4.
Pumping lemma for CFL 1 Blackboard T1 274
22
5. Closure properties of
1 Blackboard T1 281
23 IV Context Free Languages
6. TuringMachine : Basic
24 model – definition and 1 Blackboard T1 307
representation
7. Instantaneous
1 Blackboard T1 320
25 Description
8. Languageacceptance by
26 TM -TM as Computer of 1 Blackboard T1 368
Integer functions
9. Programming techniques
for Turingmachines 1 Blackboard T1 375
(subroutines)
UNIT V UNDECIDABILITY
1. Unsolvable Problems and
40 1 Blackboard T2 383
Computable Functions
2. PCP-MPCP 1 Blackboard T2 392
41
3. V Recursive and
42 recursivelyenumerable 1 Blackboard T2 373
languages-Properties
4. Tractable and Intractable
43 1 Blackboard T2 413
problems
5. P and NP completeness 1 Blackboard T2 414
44
6. Kruskal’s algorithm 2 Blackboard T2 414
45
7. Travelling Salesman
2 Blackboard T2 419
Problem
8. 3-CNF SAT problems 1 Blackboard T2 428
*Beyond the syllabus topics to be included

9.Class Time Table

I BREA II V BREA V VI
PERIOD I IV
I K I V I K II II
9.50 12.30
9.00 10.50 11.40 1.00 1.45 2.40 3.25
DAY/ – 10.40- -1.00 2.30-
– - - - - - -
TIME 10.4 10.50 2.40
9.50 11.40 12.30 1.45 2.30 3.25 4.10
0
DAY 1 GE345 CS345 CS349
CS3492 CS3401
1 2 2 CS3461 OS LAB
DBMS ALG
EVS TOC DBMS
DAY 2 CS345 CS349 CS345 CS349 CS340 CS340
GE3451 CS3401
2 2 1 1 1 1
EVS ALG
TOC DBMS OS AIML ALG ALG
BREAK
DAY 3 CS345 CS340 CS349 CS345 CS345 CS349
CS3492 GE3451 LUNC
1 1 BREAK DBMS EVS
1 2 1 1
OS ALG H AIML TOC OS AIML
DAY 4 CS349 CS340 CS345
CS3492 CS3451
1 1 2 CS3481 DBMS LAB
DBMS OS
AIML ALG TOC
DAY 5 CS349 CS345 CS340 GE345 CS349 CS349
CS3491 CS3401
2 2 1 1 BREAK 1 1
AIML ALG
DBMS TOC ALG EVS AIML AIML

9.Course Time Table

I BREA II V BREA V VI
PERIOD I IV
I K I V I K II II
9.50 12.30
9.00 10.50 11.40 1.00 1.45 2.40 3.25
DAY/ – 10.40- -1.00 2.30-
– - - - - - -
TIME 10.4 10.50 2.40
9.50 11.40 12.30 1.45 2.30 3.25 4.10
0
DAY 1 CS345
2
TOC
DAY 2 CS345
2
TOC
BREAK
DAY 3 CS345
LUNC
BREAK 2
H TOC
DAY 4 CS345
2
TOC
DAY 5 CS345
2 BREAK
TOC
 10. Content Delivery Methodologies (Chalk and Board, Power
point presentations, Videos, E-content etc.)

1.Chalk and Board

2. Power point presentation.

11.Assignments

Assignmen Description Submission due

t No.

1 Regular Expressions to Automata NFA, 3/8/2023

DFA,
Minimizing DFA

2 11/9/2023

3 4/10/2023

4 16/10/2023

5 24/11/2023

12.Assignment Rubrics:

Quality Marks
Submission on Date 3
Understanding 2
Solving skill/ Presentation 2
End results with correct units conversions / 3
Conclusion

13.Mapping of CO to Assignment:

CO’s CO - STATEMENTS A1 A2 A3 A4 A5

CO1: Construct automata theory using Finite Automata 

CO2: Write regular expressions for any pattern 

Design context free grammar and Pushdown Automata

CO3: 

CO4: Design Turing machine for computational functions 

CO5: Differentiate between decidable and undecidable problems 

14.Assessment Methodologies:

Assessment Tool Description

Internal Test
(30%)
40
Direct
Assignments %
Assessme
(10%)
nt
(80%)
End semester 60
Examination %
Indirect Course End Survey
Assessme (80%)
nt
Exit Survey (20 %)
(20%)

15.Distribution of portions for assessment tests

Assessments Portion Covering Unit % of weightage

IAT – I Unit I & unit II (50%) 20
IAT – II Unit III , Unit III & Unit V 20
Assignments Unit – I to Unit-V 20
Class Test Unit – I to Unit-V 20
Attendance 20
End Semester Unit - I to V 100

16.Content beyond syllabus

1. Language Grammar
2. Automata theory and computability
 Prepared by: Verified by
Signature

Name : A.Anorelin Ms.M.Princy Usha Dr.A.Albert Raj

Designation: AP / CSE HoD / CSE Principal