BRAINWARE UNIVERSITY

[PCC-CSM404] [2023-2024]
MICRO LECTURE PLAN
Name of the Instructor/Faculty: PRANASHI CHAKRABORTY
Designation of Faculty: ASSISTANT PFROFESSOR
Department of Faculty: COMPUTER SCIENCE AND ENGINEERING
Course Name & Code: FORMAL LANGUAGE AND AUTOMATA THEORY (PCC-CSM404)
Course Credit: 3 Weekly L-T-P: 3L-0-0 Total Contact Hours in the semester: 45 Maximum Marks: 100
Programme(s) Name & Semester/Term: B.TECH IN COMPUTER SCIENCE AND ENGINEERING (AIML-2022) /4TH SEMESTER
Target students [Section(s)/Group(s)] & Total Students: BCSE-4C(AIML) [63]

Course Outcomes and Module(s) Mapping (M1, M2, M3, M4, M5, M6, M7 etc. whichever is/are applicable)
SL.NO Course Outcomes Module(s)

CO1 Explain and manipulate the different concepts in automata theory and formal languages. M1
CO2 Describe the language accepted by an automata and Prove properties of languages, grammars and M2
automata with rigorously formal mathematical methods.
CO3 Sketch the different type of Automata for different types of Languages and Simplify automata and M3
context-free grammars.
CO4 Distinguish between various normal forms and transform between pushdown automata and M3
contest free grammars to a competent level.
CO5 Define Turing machines performing simple tasks and Judge whether certain languages are regular M4, M5
or context free with the use of pumping lemma.
Components of Assessments:
1. Assignments [Weight -10 Marks]
a. Assignment 1(Marks)- As per the notice after 30% coverage of syllabus
b. Assignment 2(Marks)- As per the notice after 70% coverage of syllabus
c. Other Activities (Please specify, if applicable)
2. Presentation [Weight -10 Marks]- As per the notice
3. Two Class Tests [Weight -20 Marks]- As per the notice
4. End Semester Examination [60 Marks]- As per the notice
 BRAINWARE UNIVERSITY
[PCC-CSM404] [2023-2024]

Teaching Methodologies
(Lecture/Tutorial/ Page Reference Book(s)
Module Quiz/Presentation Duration Number with
Topics Dates Text Book(s) with Chapters & Sections
No. /Experiential learning (in hours) of Chapters/Sections
/Problem-solving/ Text Book (if applicable)
Specify, if any others)
L1: Alphabet 15.02.2024 Lecture Introduction to Automata Theory, 28-29
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 1.5
L2: languages 16.02.2024 Lecture with Problem-solving Introduction to Automata Theory, 29-30
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 1.5
L3: Grammars 16.02.2024 Lecture with Problem-solving Introduction to Automata Theory, 157-203
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.1
L4: productions 22.02.2024 Lecture with Problem-solving Introduction to Automata Theory, 157-203
M1 1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.1
L5: derivation 23.02.2024 Lecture with Problem-solving Introduction to Automata Theory, 157-203
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
L6: Chomsky hierarchy of 23.02.2024 Lecture Introduction to Automata Theory, 79-154
languages 1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 3.1
L7: Revision of some set theory 29.02.2024 Lecture with Quiz Introduction to Automata Theory, 79-154
concepts 1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 3.1
L8: Regular expressions and 01.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 79-154
languages 1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 3.1
L9: deterministic finite automata 01.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 36-73
(DFA) 1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 2.1

[PCC-CSM404]
L10: DFA and equivalence with
regular expressions
L11: nondeterministic finite
automata (NFA)
L12: NFA and equivalence with
DFA
Assignment-1
M2
L13: regular grammars
L14: regular grammars equivalence
with finite automata
L15: properties of regular
languages
L16: pumping lemma for regular
languages
L17: minimization of finite
automata, Problems on Pumping
Lemma
L18: Context-free grammars (CFG)
L19: Context-free grammars (CFG)
and languages (CFL)
L20: Chomsky normal forms
BRAINWARE UNIVERSITY
[2023-2024]
07.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 43-50
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 2.2
08.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 53-57
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 2.3
08.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 57-77
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 2.4
09.03.2024 Evaluative process - - -
- -
23.03.2024
14.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 157-203
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.1
15.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 157-203
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.1
15.03.2024 Lecture with Quiz Introduction to Automata Theory, 117-121
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 4.1
21.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 117-121
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 4.1
22.03.2024 Flip Class 1 Introduction to Automata Theory, 143, 152-
1 Languages, and Computation, J. E. H., 153
R.M. & J. D. Ullman, Ch: 4.4
22.03.2024 Lecture Introduction to Automata Theory, 157-168
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
28.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 157-168
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.1
29.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 169-174
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.2
 BRAINWARE UNIVERSITY
[PCC-CSM404] [2023-2024]
L21: Greibach normal forms 29.03.2024 Lecture with Problem-solving Introduction to Automata Theory, 169-174
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.2
Class Test 1 01.04.2024 - - - -
06.04.2024 -
L22: nondeterministic pushdown 18.04.2024 Lecture with Problem-solving Introduction to Automata Theory, 205-209
M3 automata (PDA) 1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 6.1
L23: PDA and equivalence with 19.04.2024 Lecture with Quiz Introduction to Automata Theory, 214-220
CFG 1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 6.2
L24: parse trees 19.04.2024 Lecture with Problem-solving Introduction to Automata Theory, 169-174
1 Languages, and Computation, J. E. H., R.
M. & J. D. Ullman, Ch: 5.2
L25: ambiguity in CFG 25.04.2024 Lecture with Problem-solving Introduction to Automata Theory, 192-203
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.4
L26: pumping lemma for context- 26.04.2024 Lecture with Problem-solving Introduction to Automata Theory, 257-262
free languages 1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 7.2
L27: deterministic pushdown 26.04.2024 Lecture with Problem-solving Introduction to Automata Theory, 205-214
automata 1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 6.1
L28: Context-sensitive grammars 02.05.2024 Lecture with Quiz Introduction to Automata Theory, 239-250
(CSG) 1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 7.1
L29: CSG and languages 03.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
L30: linear bounded automata 03.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
Assignment-2 03.05.2024 Evaluative process - - - -
Presentation 06.05.2024 Evaluative process - - -
- -
23.05.2024

[PCC-CSM404]
L31: Defining a function
M4 L32: LBA equivalence with CSG
L33: CSG Applications
L34: CSG Applications
L35: Revision of module
L36: The basic model for Turing
machines
L37: Turing- recognizable
L38: Turing-decidable (recursive)
L39: closure properties
L40: variants of Turing machines,
nondeterministic TMs and
equivalence with deterministic TMs
L41: unrestricted grammars and
equivalence with Turing machines
BRAINWARE UNIVERSITY
[2023-2024]
09.05.2024 Lecture Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
10.05.2024 Flip Class 2 Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
10.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
16.05.2024 Lecture Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
17.05.2024 Lecture Introduction to Automata Theory, 165-200
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 5.1
17.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 287-296
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 8.1-8.2
23.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 287-296
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 8.1-8.2
24.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 287-296
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 8.1-8.2
24.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 122-123
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 4.2
30.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 314-322
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 8.4
31.05.2024 Lecture with Problem-solving Introduction to Automata Theory, 322-332
1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 8.5
 BRAINWARE UNIVERSITY
[PCC-CSM404] [2023-2024]
L42: TMs as enumerators 31.05.2024 Flip Class 3 Introduction to Automata Theory, 306
M5 1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 8.2.5
Class Test 2 03.06.2024 - - - -
- -
07.06.2024
L43: Church-Turing thesis, 13.06.2024 Lecture with Problem-solving Introduction to Automata Theory, 352-354
universal Turing machine 1 Languages, and Computation, J. E. H.,
R.M. & J. D. Ullman, Ch: 9.2.3
L44: universal and diagonalization 14.06.2024 Lecture with Problem-solving Introduction to Automata Theory, 346-347,
languages, reduction between 1 Languages, and Computation, J. E. H., 349-357,
languages R.M. & J. D. Ullman, Ch: 9.1, 9.2, 9.3.3 362-364
L45: Rice’s theorem, undecidable 14.06.2024 Lecture with Problem-solving Introduction to Automata Theory, 349-357,
problems about languages 1 Languages, and Computation, J. E. H., 362-364
R.M. & J. D. Ullman, Ch: 9.2, 9.3.3
Term End Examination 24.06.2024 Evaluation - - -
-
-
27.07.2024
Total Lecture Hours: 45
Total Tutorial Hours: 0
Total Activities Hours (Quiz/Presentation/Experiential learning etc):6
Text Books
1. Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev
Motwani and Jeffrey D. Ullman, Pearson Education Asia.
Reference Books
1. Elements of the Theory of Computation,Harry R. Lewis and Christos H. Papadimitriou, Pearson Education Asia
2. Introduction to the Theory of Computation, Michael Sipser, PWS Publishing
3. Introduction to Languages and The Theory of Computation ,John Martin , Tata McGraw Hill.
Other Learning Resources (Name and/or URL of Journals/MOOCs/Online Resources, if Applicable)

Signature of the Faculty:

Name of the Faculty: PRANASHI CHAKRABORTY

Designation of the Faculty: ASSISTANT PROFESSOR