Modules / Lectures
Module NameDownload
noc19_ma15_Assignment10noc19_ma15_Assignment10
noc19_ma15_Assignment11noc19_ma15_Assignment11
noc19_ma15_Assignment12noc19_ma15_Assignment12
noc19_ma15_Assignment13noc19_ma15_Assignment13
noc19_ma15_Assignment2noc19_ma15_Assignment2
noc19_ma15_Assignment3noc19_ma15_Assignment3
noc19_ma15_Assignment4noc19_ma15_Assignment4
noc19_ma15_Assignment5noc19_ma15_Assignment5
noc19_ma15_Assignment6noc19_ma15_Assignment6
noc19_ma15_Assignment7noc19_ma15_Assignment7
noc19_ma15_Assignment8noc19_ma15_Assignment8
noc19_ma15_Assignment9noc19_ma15_Assignment9

Sl.No Chapter Name English
1Lecture 1 : Deterministic Finite Automata (DFA)Download
To be verified
2Lecture 2 : Input alphabetDownload
To be verified
3Lecture 3 : Extended transition functionDownload
To be verified
4Lecture 4 : Language of DFADownload
To be verified
5Lecture 5 : Building DFADownload
To be verified
6Lecture 06:Building DFA (contd…)Download
To be verified
7Lecture 07: NFA (Nondeterministic Finite Automata)Download
To be verified
8Lecture 08: Language of a NFADownload
To be verified
9Lecture 09: Equivalence of DFA’s and NFA’sDownload
To be verified
10Lecture 10: Subset ConstructionDownload
To be verified
11Lecture 11 : ϵ-NFADownload
To be verified
12Lecture 12 : Extended transition function of 𝜖-NFADownload
To be verified
13Lecture 13 : Language of 𝜖-NFADownload
To be verified
14Lecture 14 : 𝜖-NFA to NFADownload
To be verified
15Lecture 15 : 𝜖-NFA to DFADownload
To be verified
16Lecture 16 : Regular expressionDownload
To be verified
17Lecture 17 : Regular expression (Contd.)Download
To be verified
18Lecture 18 : More on regular expressionDownload
To be verified
19Lecture 19 : Equivalence of 𝜖-NFA and regular expressionDownload
To be verified
20Lecture 20 : Equivalence of 𝜖-NFA and regular expression (Contd.)Download
To be verified
21Lecture 21: DFA to Regular expressionDownload
To be verified
22Lecture 22: DFA to Regular expression (Contd.)Download
To be verified
23Lecture 23: Construction of regular expression from a DFA (example)Download
To be verified
24Lecture 24: Closure properties of Regular SetDownload
To be verified
25Lecture 25: Closure properties of Regular Set (Contd.)Download
To be verified
26Lecture 26 : SubstitutionDownload
To be verified
27Lecture 27 : Pumping LemmaDownload
To be verified
28Lecture 28 : Application of the pumping lemmaDownload
To be verified
29Lecture 29 : More on Pumping lemmaDownload
To be verified
30Lecture 30 : Arden’s TheoremDownload
To be verified
31Lecture 31: Minimization of FADownload
To be verified
32Lecture 32: Minimization of FA (Cont…)Download
To be verified
33Lecture 33: Two way FADownload
To be verified
34Lecture 34: Finite automata with outputDownload
To be verified
35Lecture 35: Equivalence of Moore and Mealy machineDownload
To be verified
36Lecture 36: Context free grammars (CFG)Download
To be verified
37Lecture 37: Context free language (CFL)Download
To be verified
38Lecture 38: More example on CFLDownload
To be verified
39Lecture 39: More on CFGDownload
To be verified
40Lecture 40: Derivation Tree/Parse TreeDownload
To be verified
41Lecture 41 : Leftmost and Rightmost derivationsDownload
To be verified
42Lecture 42 : Ambiguity in CFGDownload
To be verified
43Lecture 43 : Simplification of CFGDownload
To be verified
44Lecture 44 : Algorithms to construct reduced grammarDownload
To be verified
45Lecture 45 : Elimination of Null and Unit productionsDownload
To be verified
46Lecture 46 : Chomsky Normal Form (CNF)Download
To be verified
47Lecture 47 : Greibach Normal Form (GNF)Download
To be verified
48Lecture 48 : Pushdown Automata (PDA)Download
To be verified
49Lecture 49 : Language accepted by PDADownload
To be verified
50Lecture 50 : Example of a language accepted by PDADownload
To be verified
51Lecture 51 : Deterministic PDADownload
To be verified
52Lecture 52 : Equivalence of language acceptedDownload
To be verified
53Lecture 53 : Equivalence PDADownload
To be verified
54Lecture 54 : Equivalence PDA and CFLDownload
To be verified
55Lecture 55 : Equivalence PDA and CFL (Contd.)Download
To be verified
56Lecture 56: Relationship between regular language and CFLDownload
To be verified
57Lecture 57: Pumping lemma for CFLsDownload
To be verified
58Lecture 58: Closer properties of CFLsDownload
To be verified
59Lecture 59: Turning MachineDownload
To be verified
60Lecture 60: Language accepted by a Turning machineDownload
To be verified


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available