6.

TEXT BOOKS:

1. Introduction to Automata Theory, Languages and Computation: J.E. Hopcroft and J.D Ullman,
Pearson Education, 3rd Edition.
2. Theory of computer Science (Automata Language & computations) K.L. Mishra N.
Chandrashekhar, PHI.
3. Theory of computation by SaradhiVarma, Scitech Publication

7. REFERENCE BOOKS:

1.Introduction to Languages and the Theory of Computation: Martin, Tata McGraw Hill, 3rd
Edition
FLAT-Syllabus
2.Introduction to Formal Languages, Automata Theory and Computation: K. Kirthivasan, Rama R,
Pearson Education.
3.Introduction to the theory of computation: Michael Sipser, Cengage Learning
4.Elements of Theory of Computation: Lewis, PHI
5.Theory of Automata and Formal Languages: Anand Sharma, Laxmi Publication
6.Automata Theory: Nasir and Srimani, Cambridge University Press.
7.Introduction to Computer Theory: Daniel I.A. Cohen, Willey India, 2nd Edition

8. Session Plan

Topic coverage No. of Activity Assignment Suggested

and Sessions (lecture, (project, Reading
Internal Test (in hrs.) tutorial, lab assignment, (Book, Video,
practice, field field Online source,
studies/field- study, seminar, etc.)
trip, Workshop etc.)
etc.)
MODULE-1(5 Hrs)
Introduction 1 Lecture Assignment TB1 TB2 TB3
Alphabet, 1 Lecture Assignment TB1 TB2 TB3
languages and
grammars.
Production rules 1 Lecture Assignment TB1 TB2 TB3
and derivation of
languages.
Chomsky 2 Lecture Assignment TB1 TB2 TB3
hierarchy of
languages.
 MODULE-II (07 HRS)
Finite automata 1 Lecture Assignment TB1 TB2 TB3

Types of FA with 1 Lecture Assignment TB1 TB2 TB3

examples
DFA and NFA 1 Lecture Assignment TB1 TB2 TB3
with problems

NFA to DFA 1 Lecture Assignment TB1 TB2 TB3

conversions
Equivalence of 1 Lecture Assignment TB1 TB2 TB3
DFA
NFA with epsilon 1 Lecture Assignment TB1 TB2 TB3
to NFA without
epsilon
Minimization of 1 Lecture Assignment TB1 TB2 TB3
FA
MODULE-III (07 HRS)
Regular 2 Lecture Assignment TB1 TB2 TB3
grammars
Regular 2 Lecture Assignment TB1 TB2 TB3
grammars,
regular
expressions..
Closure and 1 Lecture Assignment TB1 TB2 TB3
decision
properties of
regular sets.
Pumping lemma 1 Lecture Assignment TB1 TB2 TB3
of regular sets.
Left and right 1 Lecture Assignment TB1 TB2 TB3
linear grammars
MODULE-IV (10 HRS)
Context free 2 Lecture Assignment TB1 TB2 TB3
grammar
Parse trees and 2 Lecture Assignment TB1 TB2 TB3
derivations
Cook, Younger, 2 Lecture Assignment TB1 TB2 TB3
Kasami, and
Early's parsing
algorithms.
Ambiguity and 2 Lecture Assignment TB1 TB2 TB3
properties of
context free
languages.
Pumping lemma, 2 Lecture Assignment TB1 TB2 TB3
closure properties
of deterministic
cfl
 MODULE-V (05 HRS)
Pushdown 1 Lecture Assignment TB1 TB2 TB3
automata

Introduction to 2 Lecture Assignment TB1 TB2 TB3

Pushdown
automata. Types
(deterministic and
nondeterministic).
DPDA and 1 Lecture Assignment TB1 TB2 TB3
NPDA
CFG to PDA 1 Lecture Assignment TB1 TB2 TB3
MODULE-VI (10 HRS)
Linear bounded 2 Lecture Assignment TB1 TB2 TB3
automata

Introduction, 1 Lecture Assignment TB1 TB2 TB3

Linear bounded
automata and
context sensitive
languages.

Turing machine 2 Lecture Assignment TB1 TB2 TB3

Turing machines 1 Lecture Assignment TB1 TB2 TB3
and variation of
Turing machine
model.
Turing 1 Lecture Assignment TB1 TB2 TB3
computability.
Turing 2 Lecture Assignment TB1 TB2 TB3
computable
functions.
Church Turing 1 Lecture Assignment TB1 TB2 TB3
hypothesis.
MODULE-VII (08 Hrs)
Recursive 2 Lecture Assignment TB1 TB2 TB3
Languages
Recursive and
recursively
enumerable sets
Decidable 1 Lecture Assignment TB1 TB2 TB3
languages and
undecidable
problems

Halting problem. 1 Lecture Assignment TB1 TB2 TB3

Universal Turing 2 Lecture Assignment TB1 TB2 TB3
machine
Universal TM.
Turing 1 Lecture Assignment TB1 TB2 TB3
Reducibility
Valid and invalid 1 Lecture Assignment TB1 TB2 TB3
computations
of Turing
machines
Total (Hrs) 52 Hrs Theory=26 ; Practice=26

Developed on 22-06-2018