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

Sl.No Chapter Name English
1Lecture 1 : Deterministic Finite Automata (DFA)PDF unavailable
2Lecture 2 : Input alphabetPDF unavailable
3Lecture 3 : Extended transition functionPDF unavailable
4Lecture 4 : Language of DFAPDF unavailable
5Lecture 5 : Building DFAPDF unavailable
6Lecture 06:Building DFA (contd…)PDF unavailable
7Lecture 07: NFA (Nondeterministic Finite Automata)PDF unavailable
8Lecture 08: Language of a NFAPDF unavailable
9Lecture 09: Equivalence of DFA’s and NFA’sPDF unavailable
10Lecture 10: Subset ConstructionPDF unavailable
11Lecture 11 : ϵ-NFAPDF unavailable
12Lecture 12 : Extended transition function of 𝜖-NFAPDF unavailable
13Lecture 13 : Language of 𝜖-NFAPDF unavailable
14Lecture 14 : 𝜖-NFA to NFAPDF unavailable
15Lecture 15 : 𝜖-NFA to DFAPDF unavailable
16Lecture 16 : Regular expressionPDF unavailable
17Lecture 17 : Regular expression (Contd.)PDF unavailable
18Lecture 18 : More on regular expressionPDF unavailable
19Lecture 19 : Equivalence of 𝜖-NFA and regular expressionPDF unavailable
20Lecture 20 : Equivalence of 𝜖-NFA and regular expression (Contd.)PDF unavailable
21Lecture 21: DFA to Regular expressionPDF unavailable
22Lecture 22: DFA to Regular expression (Contd.)PDF unavailable
23Lecture 23: Construction of regular expression from a DFA (example)PDF unavailable
24Lecture 24: Closure properties of Regular SetPDF unavailable
25Lecture 25: Closure properties of Regular Set (Contd.)PDF unavailable
26Lecture 26 : SubstitutionPDF unavailable
27Lecture 27 : Pumping LemmaPDF unavailable
28Lecture 28 : Application of the pumping lemmaPDF unavailable
29Lecture 29 : More on Pumping lemmaPDF unavailable
30Lecture 30 : Arden’s TheoremPDF unavailable
31Lecture 31: Minimization of FAPDF unavailable
32Lecture 32: Minimization of FA (Cont…)PDF unavailable
33Lecture 33: Two way FAPDF unavailable
34Lecture 34: Finite automata with outputPDF unavailable
35Lecture 35: Equivalence of Moore and Mealy machinePDF unavailable
36Lecture 36: Context free grammars (CFG)PDF unavailable
37Lecture 37: Context free language (CFL)PDF unavailable
38Lecture 38: More example on CFLPDF unavailable
39Lecture 39: More on CFGPDF unavailable
40Lecture 40: Derivation Tree/Parse TreePDF unavailable
41Lecture 41 : Leftmost and Rightmost derivationsPDF unavailable
42Lecture 42 : Ambiguity in CFGPDF unavailable
43Lecture 43 : Simplification of CFGPDF unavailable
44Lecture 44 : Algorithms to construct reduced grammarPDF unavailable
45Lecture 45 : Elimination of Null and Unit productionsPDF unavailable
46Lecture 46 : Chomsky Normal Form (CNF)PDF unavailable
47Lecture 47 : Greibach Normal Form (GNF)PDF unavailable
48Lecture 48 : Pushdown Automata (PDA)PDF unavailable
49Lecture 49 : Language accepted by PDAPDF unavailable
50Lecture 50 : Example of a language accepted by PDAPDF unavailable
51Lecture 51 : Deterministic PDAPDF unavailable
52Lecture 52 : Equivalence of language acceptedPDF unavailable
53Lecture 53 : Equivalence PDAPDF unavailable
54Lecture 54 : Equivalence PDA and CFLPDF unavailable
55Lecture 55 : Equivalence PDA and CFL (Contd.)PDF unavailable
56Lecture 56: Relationship between regular language and CFLPDF unavailable
57Lecture 57: Pumping lemma for CFLsPDF unavailable
58Lecture 58: Closer properties of CFLsPDF unavailable
59Lecture 59: Turning MachinePDF unavailable
60Lecture 60: Language accepted by a Turning machinePDF unavailable


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