University of Engineering and Management

Institute of Engineering & Management, SaltLake Campus

Institute of Engineering & Management, NewTown Campus
University of Engineering & Management, Jaipur

Syllabus for B.Tech Admission Batch2022

Subject Name: Theory of Computations Credit: 3 LectureHours:36
Subject Code: PCCCS502
Pre-requisite: Elementary discrete mathematics includes the notion of set, function, relation, product, partial order, equivalence relation,
graph & tree. They should have a thorough understanding of the principle of mathematical induction.

Relevant Links:

Study Material Coursera NPTEL LinkedIn Learning InfosysSpringboard

COURSE OBJECTIVES:
1. Understand models and abstractions: automata as a basic model of computation
2. Link between languages, automata, and decision problems.
3. Understand product, union, closure properties and algebraic formalisms of languages such as regular expressions,
context-free grammar.
4. Understand algorithms and computability through the lens of Turing machines.
COURSE OUTCOMES:
CO 1: After studying Finite Automata, student will be able to define a system and recognize the behavior of a system. They
will be able to minimize a system and compare different systems.
CO2: After studying regular language and grammar student will convert Finite Automata to regular expression. Students will be able to check
equivalence between regular linear grammar and FA.
CO3: After studying CFG and PDA Students will be able to minimize context free grammar. Student will be able to check equivalence of CFL
 and PDA. They will be able to design.
CO4: After studying turing machine Students will be able to design Turing machine.

M Text Book Name Lecture

Mapping with
o Topic Sub-topics & Chapter Correspond
Industry and Hours
d Number ing Lab
International
Assign
ul Academia
ment
e
n
u
m
b
er
1 Finite Introduction to concepts of alphabet, T2-Ch1, Ch2, International Academia: 9
Automa language, production rules, Appendix A (https://ocw.mit.edu/course
ton grammar and automaton, finite state s/18-404j-theory-of- 1. Design a
Finite State
model, introduction to the concept of computation-fall-
Machine
Chomosky Classification of 2020/pages/syllabus/ ) (FSM) that
Grammar, language generation from accepts all
production rules and vice- versa; AICTE-prescribed strings over
syllabus: input
Concept of DFA and its problems, (https://www.aicte- symbols
india.org/sites/default/files/ {0, 1}
concept of NFA and its problems.
Model_Curriculum/AICTE having
NFA to DFA conversion, three
Construction of DFA & NFA for any %20-%20UG%20CSE.pdf
consecutive
given string and vice versa, )
1's as a
Minimization of FA and equivalence substring.
Industry Mapping: JFLAP,
of two FA, Mealy & moore machine 2. Design a
VAS, TAGS and SimStudio
and their problems. Limitations of Finite State
Machine
FSM.
(FSM) that
accepts all
strings over
input
symbols
{0, 1}
 which are
divisible by
3.
3. Design a
Finite State
Machine
(FSM) that
accepts all
decimal
string
which are
divisible by
3.

2 Regular Regular language and regular T2- Ch3, Ch4 International Standards 9
Langua expressions, identity rules. :(
ges and Arden’s theorem state and prove, https://ocw.mit.edu/courses
Regular Construction of NFA from regular /18-404j-theory-of-
Gramm expression, Conversion of computation-fall-
ars NFA with null moves to without null 2020/pages/syllabus/ )
moves, closure properties, pumping
lemma and its applications, proof of
pumping lemma.
 AICTE prescribed
syllabus:
(https://www.aicte-
india.org/sites/default/files/
Model_Curriculum/AICTE
%20-%20UG%20CSE.pdf )
Industry Mapping: JFLAP,
VAS, TAGS and SimStudio

3 Context- Introduction to Context Free T1- Ch5, Ch6 International Standards: 10 1. Design a
free Grammer, Derivation trees, (https://ocw.mit.edu/courses Push
Language sentential forms. Right most and /18-404j-theory-of- Down
Automat
s leftmost derivation of strings, computation-fall- a (PDA)
and concepts of ambiguity. 2020/pages/syllabus/ ) that
machine Minimization of CFG, Chomsky accepts
models. normal form, Greibach normal form, AICTE prescribed all string
syllabus: having
Pumping Lemma for Context Free
equal
Languages, Enumeration of (https://www.aicte- number
properties of CFL (proofs included). india.org/sites/default/files/ of 0's
Closure property of CFL, Ogden’s Model_Curriculum/AICTE
and 1's
lemma & its applications, Push over
%20-%20UG%20CSE.pdf ) input
Down Automata: Push down
symbol
automata, definition and description, Industry Mapping: {0, 1}
Acceptance of CFL, Acceptance by JFLAP, VAS, TAGS for a
final state and acceptance by empty and SimStudio language
state and its equivalence, 0n1n
where n
Equivalence of CFL and PDA, >= 1.
interconversion, DCFL and DPDA. 2. Design a
Program
to create
PDA
machine
that
accept
the well-
formed
parenthe
sis.
 4 Turing Turing Machine : Turing Machine, T3- Part 2 – International Standards: 8 1. Design a
machine definition, model, Design of TM, Ch3, Ch4 (https://ocw.mit.edu/courses Turing
s and Computable functions, Church’s /18-404j-theory-of- Machine
that
Comput hypothesis, counter machine, Types computation-fall-
calculate
ability of Turing machines (proofs not 2020/pages/syllabus/ ) 2's
required), Universal Turing complem
Machine, Halting problem, P, NP. AICTE prescribed syllabus:
ent of
Recursively enumerable (r.e.) and (https://www.aicte- given
recursive languages. Existence of india.org/sites/default/files/ binary
non-r.e. languages. Notion of Model_Curriculum/AICTE string.
%20-%20UG%20CSE.pdf ) 2. Design a
undecidable problems. Universal
Turing
language and universal TM. Industry Mapping: Machine
Separation of recursive and r.e. JFLAP, VAS, TAGS which
classes. and SimStudio will
incremen
t the
given
binary
number
by 1.

TEXT BOOK:
T1. Introduction to Automata, Theory, Languages and Computation. Third Edition. John Hopcroft, Rajeev Motwani, Jeffrey D. Ullmann, Pearson
Publications (Low-cost Indian edition available).
T2. Peter Linz, An Introduction to Formal Languages and Automata, Narosa Pub. House, 2011

T3. Introduction to the Theory of Computation, 3rd edition. Michael Sipser, Cengage Publications (Lowcost Indian edition available).

REFERENCEBOOKS:

1. Automata and Computability, Dexter C. Kozen. Part of the Undergraduate Texts in Computer Science book series (UTCS), Springer.
2. Elements of the Theory of Computation, 2nd edition. Harry Lewis, Christos Papadimitriou, Prentice

3. Dr. R.B.Patel, Theory of Computation, Khanna Publishing House