GANDHI INSTITUTE FOR EDUCATION & TECHNOLOGY

BANIATANGI, BAJAPUR PO, KHURDA,

BHUBANESWAR-752060
Website: www.gietbbsr.com
Department of Computer Science & Engineering
Lesson Plan
Session: 2018 Semester: 4th Department: CSE
Subject: FLAT Subject Code: PCS4I104 Faculty: Prof. N.SAMAL
CLASSES
MODULE LESSON TITLE LESSON DESCRIPTION REQUIRED RESOURCES
Introduction Fundamentals of Formal Language 1
T1 , R2
Mathematical Fundamentals Alphabet, String, Languages 1 T1 , R2
Mathematical Fundamentals Grammars, 1 T1 , R2
MODULE-1

Mathematical Fundamentals Strings and operations on strings. 1 T1 , R2

Finite Automata Definition, Basic model 1 T1 , R2
Finite Automata Types of Finite Automata 1 T1 , R2
Finite Automata NFA vs. DFA 1 T1 , R2
Finite Automata NFA to DFA conversion 1 T1 , R2
Finite Automata Eliminating ε-transitions from NFA 2 T1 , R2
Finite Automata NFA as a language acceptor
1 T1 , R2
Finite Automata Minimization of Finite Automata
1 T1 , R2
Finite Automata Design of DFA. 1 T1 , R2
Regular Expressions: Operators in Regular expressions, 1
T1 , R2
Regular Expressions: Building Finite Automata from Regular 2
expression, T1 , R2
Regular Expressions: Arden’s theorem, 1 T1 , R2
MODULE-2

Regular Expressions: Building Regular expression from Finite 2

Automata, T1 , R2
Regular Expressions: Pumping Lemma for Regular languages, 1 T1 , R2
Regular Expressions: Closure properties of Regular languages. 1 T1 , R2
Regular Expressions: CYK algorithm. 2 T1 , R2
Context Free Grammars: Derivation and Parse Trees,
2 T1 , R2
Context Free Grammars: Ambiguity, limination of Ambiguity, 1 T1 , R2
Context Free Grammars: Simplification of a CFG, 1 T1 , R2
Context Free Grammars: Chomsky and Greibach Normal Forms. 1 T1 , R2
Context Free Grammars: Closure and Decision Properties of CFL 1 T1 , R2
Context Free Grammars: Pumping Lemma for CFL. 2 T1 , R2
Push Down Automata: Basic Model, Components, Moves of a PDA, 1
ID of a PDA, T1 , R2
Push Down Automata: Design of a PDA, 1 T1 , R2
Push Down Automata: PDA to CFG and CGA to PDA conversion. 1 T1 , R2
MODULE-3

Turing Machines: Model, Components, move of a TM, ID of TM, 1 T1 , R2

Turing Machines: design of a TM, Recursivelyn Enumerable 1
Languages, T1 , R2
Turing Machines: Variation of Turing Machine model, Universal 1
Turing Machine T1 , R2
Turing Machines: Undecidable problems, Undecidability of 1
Post correspondence problem. T1 , R2
Linear Bounded Automata Linear Bounded Automata 1 T1 , R2
Context Sensitive Languages, Context Sensitive Languages, 1 T1 , R2
Chomsky’s Hierarchy of Chomsky’s Hierarchy of Languages. 2
Languages. T1 , R2
Primitive Recursive functions: μ-Recursive functions, 1 T1 , R2
MOD
 Primitive Recursive functions: Cantor and Godel numbering, 2

MODULE-4 Primitive Recursive functions: Ackermann's function, 1

T1 , R2

T1 , R2
Primitive Recursive functions: Excursiveness of Ackermann and Turing 2
computable functions. T1 , R2
Primitive Recursive functions: Church Turing hypothesis, Recursive and 1
Recursively Enumerable sets, T1 , R2
NP Completeness: P and NP, NP complete 1 T1 , R2
NP Completeness: NP Hard problems. 2 T1 , R2

Text Books:
1. Introduction to Automata Theory, Languages and Computation: J. E. Hopcroft, J. D Ullman, Pearson Education.
2. Formal Language and Automata Theory, C. K. Nagpal, Oxford University Press.
Reference Books:
1. Introduction to Formal Languages, Automata Theory and Computation, K. Kirthivasan, Rama R, Pearson
Education.
2. Introduction to Languages and the Theory of Computation, Martin, Tata Mc-Graw Hill.
3. Theory of Computation, V. Kulkarni, Oxford University Press.
4. Elements of Theory of Computation, Lewis, PHI.
5. Introduction to the theory of computation, Michael Sipser, Cengage Learning.

Signature of Faculty Signature of HOD

Signature of Principal