| Module Name | Download |
|---|---|
| noc19_ma15_Assignment10 | noc19_ma15_Assignment10 |
| noc19_ma15_Assignment11 | noc19_ma15_Assignment11 |
| noc19_ma15_Assignment12 | noc19_ma15_Assignment12 |
| noc19_ma15_Assignment13 | noc19_ma15_Assignment13 |
| noc19_ma15_Assignment2 | noc19_ma15_Assignment2 |
| noc19_ma15_Assignment3 | noc19_ma15_Assignment3 |
| noc19_ma15_Assignment4 | noc19_ma15_Assignment4 |
| noc19_ma15_Assignment5 | noc19_ma15_Assignment5 |
| noc19_ma15_Assignment6 | noc19_ma15_Assignment6 |
| noc19_ma15_Assignment7 | noc19_ma15_Assignment7 |
| noc19_ma15_Assignment8 | noc19_ma15_Assignment8 |
| noc19_ma15_Assignment9 | noc19_ma15_Assignment9 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 1 : Deterministic Finite Automata (DFA) | Download |
| 2 | Lecture 2 : Input alphabet | Download |
| 3 | Lecture 3 : Extended transition function | Download |
| 4 | Lecture 4 : Language of DFA | Download |
| 5 | Lecture 5 : Building DFA | Download |
| 6 | Lecture 06:Building DFA (contd…) | Download |
| 7 | Lecture 07: NFA (Nondeterministic Finite Automata) | Download |
| 8 | Lecture 08: Language of a NFA | Download |
| 9 | Lecture 09: Equivalence of DFA’s and NFA’s | Download |
| 10 | Lecture 10: Subset Construction | Download |
| 11 | Lecture 11 : ϵ-NFA | Download |
| 12 | Lecture 12 : Extended transition function of ðœ–-NFA | Download |
| 13 | Lecture 13 : Language of ðœ–-NFA | Download |
| 14 | Lecture 14 : ðœ–-NFA to NFA | Download |
| 15 | Lecture 15 : ðœ–-NFA to DFA | Download |
| 16 | Lecture 16 : Regular expression | Download |
| 17 | Lecture 17 : Regular expression (Contd.) | Download |
| 18 | Lecture 18 : More on regular expression | Download |
| 19 | Lecture 19 : Equivalence of ðœ–-NFA and regular expression | Download |
| 20 | Lecture 20 : Equivalence of ðœ–-NFA and regular expression (Contd.) | Download |
| 21 | Lecture 21: DFA to Regular expression | Download |
| 22 | Lecture 22: DFA to Regular expression (Contd.) | Download |
| 23 | Lecture 23: Construction of regular expression from a DFA (example) | Download |
| 24 | Lecture 24: Closure properties of Regular Set | Download |
| 25 | Lecture 25: Closure properties of Regular Set (Contd.) | Download |
| 26 | Lecture 26 : Substitution | Download |
| 27 | Lecture 27 : Pumping Lemma | Download |
| 28 | Lecture 28 : Application of the pumping lemma | Download |
| 29 | Lecture 29 : More on Pumping lemma | Download |
| 30 | Lecture 30 : Arden’s Theorem | Download |
| 31 | Lecture 31: Minimization of FA | Download |
| 32 | Lecture 32: Minimization of FA (Cont…) | Download |
| 33 | Lecture 33: Two way FA | Download |
| 34 | Lecture 34: Finite automata with output | Download |
| 35 | Lecture 35: Equivalence of Moore and Mealy machine | Download |
| 36 | Lecture 36: Context free grammars (CFG) | Download |
| 37 | Lecture 37: Context free language (CFL) | Download |
| 38 | Lecture 38: More example on CFL | Download |
| 39 | Lecture 39: More on CFG | Download |
| 40 | Lecture 40: Derivation Tree/Parse Tree | Download |
| 41 | Lecture 41 : Leftmost and Rightmost derivations | Download |
| 42 | Lecture 42 : Ambiguity in CFG | Download |
| 43 | Lecture 43 : Simplification of CFG | Download |
| 44 | Lecture 44 : Algorithms to construct reduced grammar | Download |
| 45 | Lecture 45 : Elimination of Null and Unit productions | Download |
| 46 | Lecture 46 : Chomsky Normal Form (CNF) | Download |
| 47 | Lecture 47 : Greibach Normal Form (GNF) | Download |
| 48 | Lecture 48 : Pushdown Automata (PDA) | Download |
| 49 | Lecture 49 : Language accepted by PDA | Download |
| 50 | Lecture 50 : Example of a language accepted by PDA | Download |
| 51 | Lecture 51 : Deterministic PDA | Download |
| 52 | Lecture 52 : Equivalence of language accepted | Download |
| 53 | Lecture 53 : Equivalence PDA | Download |
| 54 | Lecture 54 : Equivalence PDA and CFL | Download |
| 55 | Lecture 55 : Equivalence PDA and CFL (Contd.) | Download |
| 56 | Lecture 56: Relationship between regular language and CFL | Download |
| 57 | Lecture 57: Pumping lemma for CFLs | Download |
| 58 | Lecture 58: Closer properties of CFLs | Download |
| 59 | Lecture 59: Turning Machine | Download |
| 60 | Lecture 60: Language accepted by a Turning machine | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 1 : Deterministic Finite Automata (DFA) | Download To be verified |
| 2 | Lecture 2 : Input alphabet | Download To be verified |
| 3 | Lecture 3 : Extended transition function | Download To be verified |
| 4 | Lecture 4 : Language of DFA | Download To be verified |
| 5 | Lecture 5 : Building DFA | Download To be verified |
| 6 | Lecture 06:Building DFA (contd…) | Download To be verified |
| 7 | Lecture 07: NFA (Nondeterministic Finite Automata) | Download To be verified |
| 8 | Lecture 08: Language of a NFA | Download To be verified |
| 9 | Lecture 09: Equivalence of DFA’s and NFA’s | Download To be verified |
| 10 | Lecture 10: Subset Construction | Download To be verified |
| 11 | Lecture 11 : ϵ-NFA | Download To be verified |
| 12 | Lecture 12 : Extended transition function of ðœ–-NFA | Download To be verified |
| 13 | Lecture 13 : Language of ðœ–-NFA | Download To be verified |
| 14 | Lecture 14 : ðœ–-NFA to NFA | Download To be verified |
| 15 | Lecture 15 : ðœ–-NFA to DFA | Download To be verified |
| 16 | Lecture 16 : Regular expression | Download To be verified |
| 17 | Lecture 17 : Regular expression (Contd.) | Download To be verified |
| 18 | Lecture 18 : More on regular expression | Download To be verified |
| 19 | Lecture 19 : Equivalence of ðœ–-NFA and regular expression | Download To be verified |
| 20 | Lecture 20 : Equivalence of ðœ–-NFA and regular expression (Contd.) | Download To be verified |
| 21 | Lecture 21: DFA to Regular expression | Download To be verified |
| 22 | Lecture 22: DFA to Regular expression (Contd.) | Download To be verified |
| 23 | Lecture 23: Construction of regular expression from a DFA (example) | Download To be verified |
| 24 | Lecture 24: Closure properties of Regular Set | Download To be verified |
| 25 | Lecture 25: Closure properties of Regular Set (Contd.) | Download To be verified |
| 26 | Lecture 26 : Substitution | Download To be verified |
| 27 | Lecture 27 : Pumping Lemma | Download To be verified |
| 28 | Lecture 28 : Application of the pumping lemma | Download To be verified |
| 29 | Lecture 29 : More on Pumping lemma | Download To be verified |
| 30 | Lecture 30 : Arden’s Theorem | Download To be verified |
| 31 | Lecture 31: Minimization of FA | Download To be verified |
| 32 | Lecture 32: Minimization of FA (Cont…) | Download To be verified |
| 33 | Lecture 33: Two way FA | Download To be verified |
| 34 | Lecture 34: Finite automata with output | Download To be verified |
| 35 | Lecture 35: Equivalence of Moore and Mealy machine | Download To be verified |
| 36 | Lecture 36: Context free grammars (CFG) | Download To be verified |
| 37 | Lecture 37: Context free language (CFL) | Download To be verified |
| 38 | Lecture 38: More example on CFL | Download To be verified |
| 39 | Lecture 39: More on CFG | Download To be verified |
| 40 | Lecture 40: Derivation Tree/Parse Tree | Download To be verified |
| 41 | Lecture 41 : Leftmost and Rightmost derivations | Download To be verified |
| 42 | Lecture 42 : Ambiguity in CFG | Download To be verified |
| 43 | Lecture 43 : Simplification of CFG | Download To be verified |
| 44 | Lecture 44 : Algorithms to construct reduced grammar | Download To be verified |
| 45 | Lecture 45 : Elimination of Null and Unit productions | Download To be verified |
| 46 | Lecture 46 : Chomsky Normal Form (CNF) | Download To be verified |
| 47 | Lecture 47 : Greibach Normal Form (GNF) | Download To be verified |
| 48 | Lecture 48 : Pushdown Automata (PDA) | Download To be verified |
| 49 | Lecture 49 : Language accepted by PDA | Download To be verified |
| 50 | Lecture 50 : Example of a language accepted by PDA | Download To be verified |
| 51 | Lecture 51 : Deterministic PDA | Download To be verified |
| 52 | Lecture 52 : Equivalence of language accepted | Download To be verified |
| 53 | Lecture 53 : Equivalence PDA | Download To be verified |
| 54 | Lecture 54 : Equivalence PDA and CFL | Download To be verified |
| 55 | Lecture 55 : Equivalence PDA and CFL (Contd.) | Download To be verified |
| 56 | Lecture 56: Relationship between regular language and CFL | Download To be verified |
| 57 | Lecture 57: Pumping lemma for CFLs | Download To be verified |
| 58 | Lecture 58: Closer properties of CFLs | Download To be verified |
| 59 | Lecture 59: Turning Machine | Download To be verified |
| 60 | Lecture 60: Language accepted by a Turning machine | Download To be verified |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |