ITE1006 Theory of Computation

LTPJC
3 0 0 0 3
Pre-req: MAT1014
Objectives:
To introduce students to the mathematical foundations of computation
To develop students' ability to understand and conduct mathematical proofs for computation
and algorithms.
To prepare students for more advanced courses in automation theory, formal languages,
algorithms & logic
Expected Outcomes:
On completion of this course, students will be able to
Understand the essence of computing through simple computational models.
Apply these models in practice to solving problems in diverse areas such as pattern matching,
cryptography, and language design.
Think analytically and intuitively for problemsolving situations in related areas of theory in
computer science.
Module Topics L Hrs SLO
Mathematical preliminaries:
Sets-Sequences and tuples- functions and relation-graphs-Types of
1 5 1,2
proof-proof by construction, proof by contradiction, proof by
induction-Introduction-Strings, Languages, Grammars, Automata.
Deterministic Finite Automata (DFA):
Introduction to Finite automata (FA) and examples Language
2 acceptance and string acceptance by a DFA-Closure properties- 5 1,5
Minimization of finite automata-Regular languages- Non regular
languages.
Non- Deterministic Finite Automata(NFA):
Introduction and examples-Conversion from DFA to NFA Finite
3 6 1,5
Automata with Epsilon transitions- Equivalence of NFA and DFA - FA
with output-Moore and mealy machine.
Regular Expression (RE):
Recursive definition of regular expression-Regular set-Identities of RE-
4 5 1
Equivalence of RE-Identity rules-Inter Conversion RE and FA,
Pumping lemma.
Context-free Grammar (CFG):
Introduction- Definition, Right-linear grammar-left linear grammar-
5 6 1
conversion from right linear grammar to left linear grammar-derivation
and ambiguity-Simplification of CFG-Normal forms.
Push down automata (PDA):
6 Definition- Construction of pushdown automata- Equivalence of push 6 1,5
down automata and context-free grammar.
Turing machine(TM):
Definition-Design of Turing machine-Types of Turing machines -
Introduction to Context sensitive grammar and languages-Linear
7 bounded automata. 10 1,5
Undecidabilty:
Recursively enumerable and recursive languages - Undecidable problems
- Halting and PCP problem - Halting problem is undecidable - Chomsky
 hierarchy of languages.
8 Expert talk on Applications of Formal Languages 2 17
Total Lecture Hours
# Mode: Flipped Class Room, [Lecture to be videotaped], Use of physical and 45
computer models to lecture, Visit to Industry, Min of 2 lectures by industry experts
Text Book
1. Peter Linz, Introduction to Formal Languages and Automata Theory, PHI, 2011.
Reference Books
1. Michael Sipser, Introduction to the Theory of Computation, Third Edition, Wadsworth
Publishing Co Inc, 2012.
2. Lewis H.P. & Papadimition C.H., Elements of Theory of Computation, Second Edition, PHI,
2015.
3. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and
Computation, Addison- Wesley, 2008.
Compiled By: Prof. Ramya G