Indraprastha Institute of Technology & Management, New Delhi
Batch: 2021-2025
Lesson Plan: FORMAL LANGUAGES AND AUTOMATA (BTECH - V)
Course Name: BTECH Semester -V Paper Code: PCC-CSE-305G
Date of commencement of classes: 16.08.2023
No of hours allotted per week: 4 Hrs.
No of hours allotted to complete the syllabus: 40 Hrs
Date on
Lecture
Module Methodology Reference which
No.
Delivered
Unit- I Finite Automata: R1,R2
L-1 Introduction: Set, Power Set, Super Lecture
Set
Alphabet, languages and grammars, Lecture R1
L-2
productions and derivation
Lecture R1
L-3 Deterministic finite automata (DFA)
Deterministic finite automata (DFA) R1
L-4 Lecture
Question
NonDeterministic finite automata Lecture R1
L-5
(NDFA)
NonDeterministic finite automata Lecture R1
L-6
(NDFA) Question
Equivalence of DFA and NDFA, Lecture R1,R2
L-7
Conversion of NFA to DFA
L-8 Minimization of finite automata Lecture R1,R2
Finite automata with ϵ- moves, Lecture R1,R2
L-9 Acceptability of a string by a finite
Automata.
Introduction to Machines: Properties Lecture R2
L-10
and limitations of Finite Automata,
Mealy and Moore Machines,.
Equivalence of Mealy and Moore Lecture R1,R2
L-11
machines
L-12 CLASS TEST I
L-13 Unit II Regular Expression Lecture R1,R2
Regular Expression: State and prove Lecture R1
L-14
Arden’s Method,
L-15 Regular Expressions Lecture R1
Regular Expressions Lecture R1
Recursive definition of regular Lecture R1,R2
L-16
expression
Regular expression conversion to Lecture R1,R2
L-17
Finite Automata and vice versa.
Properties of regular languages: Lecture R1,R2
L-18
Regular language
Pumping lemma for regular Lecture R1,R2
L-19 sets/languages, Application of regular
languages.
L-20 Class Test 1
L-21 Unit III Grammars Lecture
Grammars: Chomsky hierarchy of Lecture R1,R2
L-22 languages, Relation between different
types of grammars,
Context-free grammar, Derivation Lecture R1,R2
L-23
tree / Parse tree
Ambiguity in regular grammar and Lecture R1
L-24
their removal
Reduced Forms: Removal of useless R1,R2
L-25 Lecture
symbols, null and unit productions
Normal Form: Chomsky Normal Lecture R1,R2
L-26 form(CNF) and Greibach Normal
Form(GNF),
Push Down Automata: Introduction Lecture R1,R2
L-27
to PDA, Deterministic
L-28 Non-Deterministic PDA Lecture
Design of PDA: Transition table, Lecture R1,R2
L-29 Transition diagram and acceptability
of strings by designed PDA,
L-30 PDA Design Lecture R1
Pushdown automata (PDA) and Lecture R1
L-31
equivalence with CFG.
L-32 Class Test 2
L-33 Unit IV Turing Machine Lecture
Turing machines: The basic model Lecture R2
L-34 for Turing machines (TM),
Deterministic
NonDeterministic Turing machines Lecture R2
L-35
and their equivalence
Design of Turing Machines: Lecture R2
Transition table, Transition diagram
L-36
and acceptability of strings by
designed turing machine.
Variants of Turing machines, Halting Lecture R2
L-37 problem of Turing machine, PCP
Problem of Turing Machine
Linear Bounded Automata, TMs as Lecture R2
L-38
enumerators.
Undecidability: Church-Turing
thesis, universal Turing machine, the
L-39 Lecture R2
universal and diagonalization
languages
Reduction between languages and
L-40 Rice s theorem, undecidable Lecture R2
problems about languages
Subject Faculty Program Director Director
Ms. Kirti Mr. R.K Singh
References:
1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E.
Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata
Languages and Computation, 2nd edition, Prentice Hall of India, India.
