LESSON PLAN Regulation: R23

Class: III B.Tech –I SEM,CSE-B Course: FORMAL LANGUAGES AND AUTOMATA

THEORY
Name of the Faculty: N. MADHU BINDU Academic Year: 2025-2026

S.No Topic Mode of Proposed Conducted Remarks

teaching date date
UNIT-I
1 Finite Automatafundamentals BB 07/07/25
2 Need of Automata theory BB 08/07/25
3 Central Concepts of Automata Theory BB 09/07/25
4 Automation, Finite Automation PPT 10/07/25
5 Transition Systems BB 11/07/25
6 Acceptance of a String BB 14/07/25
7 DFA, Design of DFAs, NFA PPT 15/07/25
8 Design of NFA BB 16/07/25
17/07/25
9 Equivalence of DFA and NFA BB 18/07/25
19/07/25
10 Conversion of NFA into DFA VIDEO & BB 21/07/25
22/07/25
11 Finite Automata with Є-Transitions BB 23/07/25
24/07/25
12 Minimization of Finite Automata PPT 25/07/25
26/07/25
13 Finite Automata with output-Mealy and BB 27/07/25
Moore Machines 28/07/25
14 Applications and Limitation of Finite BB 29/07/25
Automata 30/07/25
UNIT – II
15 Regular Expressions BB 31/07/25
16 Regular Sets, Identity Rules PPT 01/08/25
02/08/25
17 Equivalence of two RE BB 04/08/25
05/08/25
18 Manipulations of REs VIDEO 06/08/25
07/08/25
19 Finite Automata and Regular PPT 08/08/25
Expressions 09/08/25
20 Inter Conversion, Equivalence between BB 11/08/25
FA and RE 12/08/25
 21 Pumping Lemma of Regular Sets BB 13/08/25
14/08/25
22 Closure Properties of Regular Sets, BB 18/08/25
Grammars 19/08/25
23 Classification of Grammars BB 20/08/25
21/08/25
24 Chomsky Hierarchy Theorem BB 22/08/25
23/08/25
25 Right and Left Linear Regular Grammars BB 25/08/25
26/08/25
26 Equivalence between RG and FA BB 28/08/25
29/08/25
27 Inter Conversion BB 30/08/25
UNIT – III
28 Formal Languages BB 08/09/25
29 Context Free Grammar PPT 09/09/25
30 Leftmost and Rightmost Derivations BB 10/09/25
31 Parse Trees VIDEO 11/09/25

32 Ambiguous Grammars PPT 13/09/25

33 Simplification of Context Free BB 15/09/25
Grammars
34 Elimination of Useless Symbols BB 16/09/25
35 Є-Productions and Unit Productions BB 17/09/25
36 Normal Forms-Chomsky Normal Form BB 18/09/25
and Greibach Normal Form
37 Pumping Lemma VIDEO 19/09/25
38 Closure Properties BB 20/09/25
23/09/25
39 Applications of Context Free Grammars BB 24/09/25
25/09/25
UNIT – IV
40 Pushdown Automata BB 26/09/25
41 Definition, Model, Graphical Notation BB 26/09/25
42 Instantaneous Description PPT 27/09/25
43 Language Acceptance of Pushdown BB 27/09/25
Automata
44 Design of Pushdown Automata VIDEO 06/10/25
45 Deterministic and Non – Deterministic BB 06/10/25
Pushdown Automata
46 Equivalence of Pushdown Automata PPT 07/10/25
and Context Free Grammars
47 Conversion BB 08/10/25
09/10/25
48 Two Stack Pushdown Automata BB 10/10/25
11/10/25
49 Application of Pushdown Automata VIDEO 13/10/25
14/10/25
UNIT – V
50 Turning Machine: Definition, Model BB 15/10/25
 51 Representation of TMs-Instantaneous BB 16/10/25
Descriptions 17/10/25
52 Transition Tables and Transition PPT 18/10/25
Diagrams 19/10/25
53 Language of a TM, Design of TMs BB 21/10/25
54 Types of TMs, Church’s Thesis BB 22/10/25
55 Universal and Restricted TM VIDEO 23/10/25
56 Decidable and Un-decidable Problems BB 24/10/25
57 Halting Problem of TMs BB 25/10/25
58 Post’s Correspondence Problem PPT 27/10/25
59 Modified PCP BB 28/10/25
60 Classes of P and NP BB 29/10/25
61 NP-Hard and NP-Complete Problems BB 30/10/25
31/10/25

COS Unit no CO
CO 1 1 To learn fundamentals of Regular and Context Free Grammars and Languages

CO 2 2 To understand the relation between Regular Language and Finite Automata and machines

CO 3 3 To learn how to design Automata’s and machines as Acceptors, Verifiers and Translators

CO 4 4 To understand the relation between Contexts free Languages, PDA and TM

CO 5 5 To learn how to design PDA as acceptor and TM as Calculators

FACULTY HOD PRINCIPAL