Course Code: CSE 228 CIE Marks: 60

Course Title: Theory of Computation SEE Marks: 40

Credits: 3
Course Syllabus:

Introduction: Formal language theory, Formal proof, Inductive proofs and Central concepts of automata
theory.

Finite Automata: Deterministic finite automata, Nondeterministic finite automata, Finite automata with ε-
transitions, Equivalence and conversion of deterministic and nondeterministic finite automata.

Regular Expressions and Languages: Regular expressions, Algebraic laws for regular expressions,
Regular languages, Pumping lemma, Closure and Decision properties of regular languages.

Context Free Grammar and Languages: Context free grammars, Parsing (or derivation) and parse trees,
Ambiguity in grammars and languages, context-free grammars, Pumping lemma for CFL’s, Closure and
Decision properties of CFL’s.

Push Down Automata: Push down automata, Acceptance by empty store and final state, Equivalence
between pushdown automata and context-free grammars, Deterministic push down automata.

Turing Machines: Turing machines, the church-Turing machine, Techniques for Turing machine
construction, Configurations, Computing with Turing machines, Restricted Turing machines, Turing
machines and computers, Combining Turing machines.

Undecidability: Recursively enumerable language, The undecidability of the halting problem,

Undecidable problems about Turing machines, Post’s correspondence problem.

Complexity Theory: The classes P, NP, examples of problems in these classes. P versus NP question. NP
completeness, Polynomial time reducibility, The Cook-Levin theorem. Examples of NP complete
problems: Vertex cover problem, Hamiltonian path problem. Approximation algorithm, Probabilistic
algorithms

Course Rationale/Description:
Central to the theory of computation are the concepts of automata, formal languages, grammar, algorithms,
computability, decidability, and complexity. Why study theory when the current focus of Computer Science (and all
the more so for Information Systems) is on technology and the pragmatic areas of knowledge concerned with the
development and management of computer information systems? The reasons are manifold. Theory provides a
simple, elegant view of the complex machine that we call a computer. Theory possesses a high degree of
permanence and stability, in contrast with the ever-changing paradigms of the technology, development, and
management of computer systems. Further, parts of the theory have direct bearing on practice, such as Automata on
circuit design, compiler design, and search algorithms; Formal Languages and Grammars on compiler design; and
Complexity on cryptography and optimization problems in manufacturing, business, and management. Last, but not
least, research-oriented students will make good use of the theory studied in this course.
Course Objective
To provide a solid conceptual understanding of the fundamentals of computation.
More specifically,

● To learn the basic concepts of computation and concepts of automata.

● To learn the structure of formal languages and grammar.
● To learn how to design Finite Automata for different Regular Expressions and Languages
● Learn how to solve various problems of applying normal form techniques, push down
automata and Turing Machines
● To learn how to construct context free grammar for various languages.

Course Learning Outcome: (at the end of the course, students will be able to do:)
CLO1
Able Able to describe the basic concepts of formal languages of finite automata techniques

Able Able to apply design principles in Finite Automata for different Regular Expressions
CLO2
and Languages

CLO3
Abl Able to demonstrate ability to develop context free grammar for various languages

CLO4
Able Able to synthesis problem and solutions in various problems of applying normal form
techniques, push down automata and Turing Machines

Content of the course:

S Course Content (as summary) H CLO’s

L rs

1 Basic concepts of formal languages of finite automata techniques 5 CLO-1

2 Design Finite Automata for different Regular Expressions and 7 CLO-2

Languages

3 Construct context free grammar for various languages 13 CLO-3

4 Solve various problems of applying normal form techniques, push 20 CLO-3

down automata and Turing Machines CLO-4
Mapping of Course Learning Outcomes to Program Learning Outcomes [attainment level used for
CLO’s from 1(weak)-3(strong) correlation]
PLO’s P P PL PL PL PL PL PL PL PLO PLO
CLO’s L L O3 O4 O5 O6 O7 O8 O9 PLO 12
O O 10
1 2 11

CLO1 ✔

CLO2 ✔

CLO3 ✔

CLO4 ✔

Mapping Course Learning Outcome (CLOs) with the Teaching-Learning and Assessment Strategy:

CLO’s Teaching Learning Assessment Corresponding Domain

Strategy Atrategy PLO number Level/
[course teacher will Learning
decide based on the Taxonomy
type of the contents]

CLO-1 Brainstorming sessions, Class PLO-1 L1

Classroom discussion, Test/Assignment/
Voice over PPT, Lecture Midterm
video, Lecture note, examination
Open discussion

CLO-2 Brainstorming sessions, Classroom PLO-3 L2, L3

Classroom discussion, discussion,
Voice over PPT Lecture Midterm
video, Lecture note, examination
Open discussion

CLO-3 Brainstorming sessions, Class PLO-2 L2

Classroom discussion, Test/Assignment/
Voice over PPT Lecture Final
video, Lecture note, examination
Open discussion

CLO-4 Brainstorming sessions, Class PLO-5 L5

Classroom discussion, Test/Assignment/
Voice over PPT Lecture Final
video, Lecture note, examination
Open discussion
Week/Lesson Discussion Topic and Book Reference Student Activities Mapping Assessme
(hour) during Online with CLO nt Plan
and Onsite and
TLA

Week-1 Lesson 1: Introduction, Formal language Online/Onsite, CLO1-PLO-1 Class Test,

theory, Formal proof, Inductive proofs Discussion Using Assignmen
t, mid
[Textbook, Chapter-1, Page (1-22)] Interactive content Exam
Lesson 1 & 2
[2.5 Hours] e.g. Voice over
PPT, PPT, Video,
H5P; TLA1

Lesson 2: Central concepts of automata Online/Onsite, CLO1-PLO-1 Class Test,

theory Discussion Using Assignmen
t, mid
( Alphabet, String, Length of String, Interactive content Exam
Power of an Alphabet, Concatenation e.g. Voice over
of of String, Languages, Problem) PPT, PPT, Video,
H5P; TLA1
[Textbook, Chapter-1, Page (28-33)]

Week-2 Lesson 1: Finite Automata, Online/Onsite, Class Test,

Deterministic Finite Automata Discussion Using CLO1-PLO-1 Assignmen
(DFA) -Formal definition, simpler Interactive content t, mid
Lesson 1 & 2 notations (state transition diagram, e.g. Voice over Exam
[2.5 Hours] transition table) PPT, PPT, Video,
[Reference Book-1, Chapter-3, Page H5P; TLA1
(71-77)]
[Textbook, Chapter-2, Page (37-52)]

Lesson 2: Language Representation Online/Onsite, Class Test,

Discussion Using CLO1-PLO-1 Assignmen
Using DFA, Exercises to design DFA t, mid
Interactive content
e.g. Voice over Exam
PPT, PPT, Video,
[Textbook, Chapter-2, Page (52-55)]
H5P; TLA1;
TLA2

Week-3 Lesson 1: Nondeterministic Finite Online/Onsite, Class Test,

Automata (NFA)- Definition of NFA, Discussion Using CLO1-PLO-1 Assignmen
language of an NFA, Exercises to t, mid
Interactive content Exam
design NFA
e.g. Voice over
PPT, PPT, Video,
[Textbook, Chapter-2, Page (55-60)] H5P; TLA1;
TLA2

Lesson 2: Equivalence of Online/Onsite, CLO1-PLO-1 Class Test,

Deterministic and Nondeterministic Discussion Using Assignmen
Finite Automata, Applications of t, mid
Interactive content Exam
Finite Automata.
e.g. Voice over
 PPT, PPT, Video,
H5P; TLA1;
[Textbook, Chapter-2, Page (60-71)
TLA2

Week-4 Lesson 1: Finite Automata with Online/Onsite, CLO-2-PLO- Class Test,

Epsilon Transitions, Eliminating Discussion Using Assignment
Lesson 1 & 2 3 , mid Exam
Epsilon transitions. Interactive content
[2.5 Hours]
[Textbook, Chapter-2, Page (72-80)] e.g. Voice over
PPT, PPT, Video,
H5P; TLA1;
TLA2

Lesson 2: Minimization of Online/Onsite, CLO2- Class Test,

Deterministic Finite Automata, Finite Discussion Using PLO-3 Assignmen
automata with output (Moore and Interactive content t, mid
Mealy machines) and Inter e.g. Voice over Exam
conversion. PPT, PPT, Video,
[Ref. Book-1, Chapter-3, Page (71- H5P; TLA1;
73, 84-101)] TLA2

Class Test# 1: Either online or onsite based on Wk1-Wk2 discussion.

Achieve CLO1 and CLO2

[Assignment 1: Based on the discussion of Wk-2; Due: Week-5]

Week-5 Lesson 1: Introduction, Identities of Online/Onsite, CLO3- Class Test,

Lesson 1 & 2 [2.5 Regular Expressions, exercises to Discussion Using PLO-2, Assignmen
Hours] represent languages using regular Interactive content CLO1- t, mid
expression e.g. Voice over PLO-1 Exam
PPT, PPT, Video,
H5P; TLA1;
[Textbook: Chapter-3, Page
TLA4
(83-101)]

Lesson 2: Finite Automata Online/Onsite, CLO3- Class Test,

and Regular Expressions Discussion Using PLO2 Assignmen
Converting from DFA’s to Interactive content CLO1- t, mid
Regular Expressions. e.g. Voice over PLO-1 Exam
PPT, PPT, Video,
Chapter-3, Page (101-108)] H5P; TLA1;
TLA4

Week-6 Lesson 1: Converting Regular Online/Onsite, CLO3- Class Test,

Lesson 1 and 2 Expressions to Automata, Discussion Using PLO2 Assignmen
[2.5 Hours] applications of Regular t, mid
Interactive content CLO1- Exam
Expressions. [Textbook:
Chapter-3, Page (101-108)] e.g. Voice over PLO-1
 PPT, PPT, Video,
H5P; TLA1;
TLA4

Lesson 2: Definition, regular Online/Onsite, CLO3 Class Test,

grammars and FA, FA for Discussion Using PLO-2, Assignmen
regular grammar. t, mid
Interactive content CLO1- Exam
[Textbook: Chapter-4, Page
(125-126)] e.g. Voice over PLO-1
PPT, PPT, Video,
H5P; TLA1;
TLA2

Week-7 Lesson 1: Regular grammar Online/Onsite, CLO3- Class Test,

Lesson 1 and 2 for FA. Discussion Using PLO- Assignmen
[ 2.5 Hours] Proving languages to be non- Interactive content 2, t, mid
regular e.g. Voice over CLO1- Exam
PPT, PPT, Video,
[Textbook: Chapter-4, Page H5P; TLA1; PLO-1
(126-127)] TLA2

Lesson 2: Pumping lemma Class Test,

[Textbook: Chapter-4, Page Assignmen
(126-127)] t, mid
Exam

Presentation 1: Topics will be provided as Individual or Group

Class Test# 2: Either online or onsite based on Wk3-Wk4 discussion.
Achieve CLO1 and CLO3

Week-8 Lesson 1: Applications of Online/Onsite, CLO3- Class

Lesson 1 & 2 Pumping lemma Discussion Using PLO-2, Test,
[2.5 Hours] Closure properties of regular Interactive content CLO1- Assignme
languages. e.g. Voice over PLO-1 nt, mid
[Textbook: Chapter-4, Page PPT, PPT, Video, Exam
(127-131)] H5P; TLA1;
TLA2

Lesson 2: Introduction to Context Free Online/Onsite, CLO3-

Discussion Using PLO-2, Class
Grammars and Language, Definition of
Interactive content CLO1- Test,
Context Free Grammars, Derivation e.g. Voice over PLO-1 Assignme
PPT, PPT, Video, nt, mid
[Textbook: Chapter-5, Page Exam
(169-172)] H5P; TLA1;
TLA2

Midterm Examination Syllabus: Week 1 – Week8

Week-9 Lesson 1: Derivation Trees, Sentential Online/Onsite, CLO3- Class

Lesson 1 & 2 Forms. Discussion Using PLO-2, Test,
[2.5 Hours] Interactive content CLO1- Assignme
[Textbook: Chapter-5, Page nt,
(173-179)] e.g. Voice over PLO-1
Final
PPT, PPT, Video, Exam
H5P; TLA1;
TLA2

Lesson 2: Rightmost and Online/Onsite, CLO3- Class

Leftmost Discussion Using PLO-2, Test,
derivations of Strings. Assignme
Interactive content CLO1-
Ambiguity nt,
in CFG’s. e.g. Voice over PLO-1 Final
PPT, PPT, Video, Exam
[Textbook: Chapter-5, Page H5P; TLA1;
(175-177)] TLA2

Week-10 Lesson 1: Properties of CFL, Normal form Online/Onsite, CLO4- Class

Lesson 1 & 2 of CFL Discussion Using PLO-5, Test,
[2.5 Hours] Elimination of Useless symbols , Unit Interactive content CLO1- Assignme
productions - Null productions, Chomsky e.g. Voice over PLO-1 nt,
PPT, PPT, Video, Final
Normal Form
H5P; TLA1; Exam
[Textbook: Chapter-7, Page
(255-273)] TLA2

Lesson 2: Minimization Online/Onsite, CLO4- Class

of CFG’s, CNF, GNF. Discussion Using PLO-5, Test,
[Textbook: Chapter-5, Page Interactive content CLO1- Assignme
(147-150)] e.g. Voice over PLO-1 nt,
PPT, PPT, Video, Final
H5P; TLA1; Exam
TLA2

Week-11 Lesson1:Pumping Lemma Online/Onsite, CLO-3 Class

Lesson 1 & 2 for CFL’s, Enumeration of Discussion Using PLO-2, Test,
[2.5 Hours] Properties of CFL (Proof’s Interactive content CLO-4 Assignme
omitted). e.g. Voice over PLO-5 nt,
[Textbook: Chapter-6, Page PPT, PPT, Video, Final
(156-168)] H5P; TLA1; Exam
TLA2

Lesson 2: Definition of Online/Onsite, CLO-3 Class

Pushdown automata, Model, Discussion Using PLO-2, Test,
Acceptance of CFL, Interactive content CLO-4 Assignme
e.g. Voice over PLO-5 nt,
[Textbook: Chapter-6, Page
PPT, PPT, Video, Final
(161, 168- 172)] Exam
H5P; TLA1;
TLA2

[Assignment 2: Due: Week-12]

Week-12 Lesson 1: Acceptance by Online/Onsite, CLO4- Class

Lesson 1 & Final State and Acceptance Discussion Using PLO-5 Test,
2 by Empty stack and its Interactive content Assignme
[2.5 Hours] Equivalence. e.g. Voice over nt,
[Textbook: Chapter-10, PPT, PPT, Video, Final
Page (258- 264)] H5P; TLA1; Exam
TLA2

Lesson 2: Equivalence of Online/Onsite, CLO4- Class

CFG and PDA. Discussion Using PLO-5 Test,
[Textbook: Chapter-10, Interactive content Assignme
Page (264- 282)] e.g. Voice over nt,
PPT, PPT, Video, Final
H5P; TLA1; Exam
TLA2

Week-13 Lesson 1: Formal Online/Onsite, CLO4- Class

Lesson 1 & definition and Discussion Using PLO-5 Test,
2 behaviour, Languages Interactive content Assignme
[2.5 Hours] of a TM e.g. Voice over nt,
[Textbook: Chapter-12, PPT, PPT, Video, Final
Page (325- 334)] H5P; TLA1; Exam
TLA2

Lesson 2: TM as accepters, Online/Onsite, CLO4- Class

and TM as a computer of Discussion Using PLO-5 Test,
integer functions, Types of Interactive content Assignme
TMs. e.g. Voice over nt,
[Textbook: Chapter-12, PPT, PPT, Video, Final
Page (334- 341)] H5P; TLA1; Exam
TLA2

Week-14 Lesson 1: Properties of Online/Onsite, CLO4- Class

Lesson 1 & recursive and recursively Discussion Using PLO-5 Test,
2 enumerable languages. Interactive content Assignme
[2.5 Hours] [Textbook: Chapter-12, e.g. Voice over nt,
Page (341- 344)] PPT, PPT, Video, Final
H5P; TLA1; TLA2 Exam

Lesson 2: Universal Turing Online/Onsite, CLO4- Class

machine, The Halting Discussion Using PLO-5 Test,
problem. Interactive content Assignme
[Textbook: Chapter-12, e.g. Voice over nt,
Page (344- 346)] PPT, PPT, Video, Final
H5P; TLA1; Exam
TLA2

Class Test# 3: Either online or onsite based on Wk8-Wk10 discussion. Achieve CLO3 and CLO4

Week-15 Lesson 1: Undecidable Online/Onsite, CLO4- Class

Lesson 1 & 2 problems about TMs. Discussion Using PLO-1 Test,
[2.5 Hours] Interactive content Assignme
e.g. Voice over nt,
 Lesson 2: Context PPT, PPT, Video, Final
sensitive language and linear H5P; TLA1; Exam
bounded automata (LBA). TLA2
[Textbook: Chapter-12, Page
(347-
352)]

Week-16 Lesson 1: Chomsky Online/Onsite, CLO1- Class

Lesson 1 & 2 hierarchy, Decidability, Post's Discussion Using PLO-1 Test,
[2.5 Hours] correspondence problem Interactive content CLO3- Assignme
(PCP), e.g. Voice over PLO-2 nt,
Lesson2: Undesirability of PCP PPT, PPT, Video, Final
[Textbook: Chapter-17, H5P; TLA1; Exam
Page (494- 501)] TLA2TLA2

Presentation 2: Topics will be provided as Individual or Group

Week-17 Lesson 1: Review class Online/Onsite, CLO1 Class

Lesson 1 on topic discussed in Discussion Using - Test,
[2.5 Hours] Week-8, Week-9, Interactive content PLO-1 Assignme
Week-10 e.g. Voice over CLO3 nt,
PPT, PPT, Video, - Final
H5P; TLA1; PLO-2 Exam
TLA2 CLO4-
PLO-5

Week – 16: Final Examination Syllabus: Week 9 – Week 16

Course Delivery Plan/Lesson Delivery Plan:
Assessment Pattern:
CO’s Mark
CO,s
(Total=100)
Assessment Task
CO1 CO2 CO3 CO4 CO5

Attendance -- 7

Class Test (CT1,

-- 15
CT2, CT3)

Assignment -- 5

Presentation -- 8

Midterm
5 10 10 0 -- 25
Examination

Semester Final
0 10 10 20 40
Examination
 Total Mark 5 20 20 20 100

CIE – Breakup (Theory) [60 marks]

Bloom’s Attendance Class Test Assignment Presentation Mid
Criteria (07) (15) (05) (08) Exam
(25)

Remember

Understand 05 02 02 05

Apply 05 03 05

Analyze 03 03 05

Evaluate 02 05

Create 03 05

SEE – Semester End Examination [40 marks] {Theory}

Bloom
Score for the Test
Criteria

Remember 05
Understand 05
Apply 10
Analyze 10
Evaluate 05
Create 05

Textbook/Recommended Readings:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman (2007), Introduction to
Automata Theory Languages and Computation, 3 edition, Pearson Education, India
rd

Reference Books:
1. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer
Science-Automata Languages and Computation, 3nd edition, Prentice
Hall of India, India.
2. Sipser, M. (2006). Introduction to the Theory of Computation (2nd ed.). Boston,
MA: Thompson Course Technology.