Course Name: Theory of Computation

Course Code: TE7299

Faculty: Engineering
Course Credit: 3
Course Level: 3
Sub-Committee (Specialization): Computer Science
Learning Objectives:
The students will be able to:
Illustrate automata theory, its types and inter conversions like Deterministic Finite
Automata (DFA), Non-Deterministic Finite Automata (NFA) and e-NFA.
Identify Regular Expressions (RE) and Regular Languages.
Analyze Context Free Grammar (CFG), different derivations, conversions and
properties.
Relate Push Down Automata (PDA) to Context Free Grammar.
Identify Turing Machine and calculate computability and complexity.
Books Book Author Publisher
Recommended:
Elements of Theory of Computation Papadimitriou C.,Lewis H.,Pearson education
Second edition Asia, ISBN
81-7808-487-2,
2004.
Introduction to Automata Theory, Hopcroft J., Motwani R., Pearson Education
Languages and Computations Ullman J., Second edition, Asia, ISBN
81-7808-347-7,
2000.
Introduction to Computer Theory Cohen D. Wiley Publications,
Second edition,
ISBN-9971-51-220-3
, 2000.
Introduction to Language and Theory of Martin J.,Third edition Tata McGraw-Hill,
Computation ISBN
0-07-049939-X,
2003.
The Theory of Computation Moret B., Pearson Education
Asia, Third Edition,
2000.
Theory of Computer Science (Automata, Mishra K., Chandrasekaran N., Prentice Hall of
Languages and Computation) Second Edition India,
ISBN-81-2030-1271-
6, 2000.
Course Outline: Contact
Actual
Sr. Hours
Topic Teaching
No. Equivale
Hours
nce
1 Automata Theory 6 6
Introduction to finite automata
automata and complexity
central concepts to automata theory

Page: 1
 deterministic finite automaton (DFA): extending the transition function
to strings
the language of DFA
Non-deterministic Finite Automaton (NFA): Extended transition
function
the language of an NFA
Equivalence of NFA and DFA
FA with e-transitions: Use of e-transitions
NFA with e
e-closures
Extended transitions and languages for e-NFA
Eliminating -transitions-Con version of NFA with e to NFA without e
Conversion of NFA without e to DFA
FA with output: Moore and Mealy machines -Definition models
inter-conversion
2 Tutorials on Automata theory that includes DFA 2 2
NFA
conversion of NFA to DFA
NFA with e-closures
Con version of NFA with e to NFA without e
Conversion of NFA without e to DFA
Moore and Mealy machines
inter-conversion
3 Regular Expressions (RE) and Languages 6 6
Regular Expressions - Operators of RE
Building RE
Precedence of operators
Algebraic laws for RE
Arden's Theorem
FA and RE: DFA to RE
RE to DFA (RE to s-NFA & e-NFA to DFA and RE to DFA-direct
method)
FA limitations
Properties of Regular Languages: pumping lemma for Regular
Languages
closure and decision properties of Regular Languages
Equivalence and minimization of automata
4 Tutorials onRegular Expressionsthat includesBuilding RE 2 2
Arden's Theorem
DFA to RE
RE to DFA
pumping lemma
minimization of automata
5 Context Free Grammars (CFG) and Languages 8 8
Context Free Grammar- Definition
derivations
languages of a grammar
sentential form
Parse Tree- inference
derivation and parse tree
from inference to tree
Ambiguity in grammars and languages: removal of ambiguity
inherent ambiguity
Properties of CFL- Normal forms- Chomsky Normal Form (CNF) and
Greibach Normal Form (GNF)
Eliminating unit productions
 useless production
useless symbols
and e-productions
Regular Grammar - definition
left linear and right linear Regular grammar
Regular grammar and Finite Automata
FA to RG and RG to FA
Inter-conversion between left linear and right linear regular grammar
Closure properties of CFL
Chomsky Hierarchy
6 Tutorials onContext Free Grammarthat includes determination 2 2
of grammar
derivations
Parse Tree
Ambiguity in grammars and its removal
simplification of grammar
CNF
GNF
left linear and right linear Regular grammar and its Inter-conversion
7 Push Down Automata (PDA) 8 8
Definition
The Language of PDA
Equivalence of PDA's and CFG- CFG to PDA
PDA to CFG
Deterministic Push Down Automata (DPDA)- Regular language and
DPDA
DPDA and CFL
DPDA and ambiguous grammar
Non-deterministic Push Down Automata (NPDA)
8 Tutorials onPDA that includes design of PDA 2 2
NPDA
graphical and flowchart representation
CFG to PDA
PDA to CFG
9 Turing Machine and decidability 6 6
Problems that computers cannot solve
The Turing Machine(TM)-Notation
the language of TM
TM and Halting
Programming techniques to TM
Extensions to basic TM
TM and Computers
Introduction to Post Machines
Comparison between FA
PDA
Post Machine and TM
10 Tutorials onTuring Machine that includes design of TM 3 3
TM as acceptor
enumerator and recognizer
calculate complexity and computability.
Total 45 45
Pre Requisites:
Knowledgeof set theory and proof by induction are desirable
Evaluation:
Assignment
 Class test
Quiz
Viva
Examination
Pedagogy:
Classroom teaching and discussions
Nptel Sessions
Tutorial sessions
Expert:
Dr.Parag Kulkarni,Professor,Founder, Chief Scientist and CEO,iknowlation Research Labs Pvt
Ltd