| Module Name | Download |
|---|---|
| Week_01_Assignment_01 | Week_01_Assignment_01 |
| Week_02_Assignment_02 | Week_02_Assignment_02 |
| Week_03_Assignment_03 | Week_03_Assignment_03 |
| Week_04_Assignment_04 | Week_04_Assignment_04 |
| Week_05_Assignment_05 | Week_05_Assignment_05 |
| Week_06_Assignment_06 | Week_06_Assignment_06 |
| Week_07_Assignment_07 | Week_07_Assignment_07 |
| Week_08_Assignment_08 | Week_08_Assignment_08 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Introduction to Finite Automata | Download |
| 2 | Basic Notation and Convention, DFA Edit Lesson | Download |
| 3 | Example of DFAs | Download |
| 4 | Computation by DFA and Regular operation | Download |
| 5 | Introduction to Nondeterminism | Download |
| 6 | NFA, definition and examples | Download |
| 7 | Equivalence of NFA and DFA, Closure properties | Download |
| 8 | Regular expressions | Download |
| 9 | Algebraic properties, RE to NFA conversion | Download |
| 10 | GNFA to RE conversion | Download |
| 11 | More closure properties of regular languages | Download |
| 12 | Non-regular languages and pumping lemma | Download |
| 13 | Examples of non-regular languages | Download |
| 14 | DFA minimization | Download |
| 15 | Introduction to CFGs | Download |
| 16 | Examples of CFGs, Reg subset of CFL | Download |
| 17 | Parse tree, derivation, ambiguity | Download |
| 18 | Normal forms, Chomsky normal form | Download |
| 19 | Non-CFLs, pumping lemma | Download |
| 20 | Examples of non- CFLs | Download |
| 21 | Pushdown Automata | Download |
| 22 | Pushdown Automata - Definition and Example | Download |
| 23 | Pushdown Automata - Examples and Relation with CFGs | Download |
| 24 | Closure Properties of CFLs | Download |
| 25 | Deterministic Context Free Languages | Download |
| 26 | Turing Machine | Download |
| 27 | More on Turing Machine | Download |
| 28 | Non deterministic Turing Machine Edit Lesson | Download |
| 29 | Configuration Graphs | Download |
| 30 | Closure Properties of Decidable and Turing recognizable languages | Download |
| 31 | Decidability properties of Regular and Context Free Languages | Download |
| 32 | Undecidability | Download |
| 33 | More on Undecidability | Download |
| 34 | Reduction | Download |
| 35 | Applications of Reduction | Download |
| 36 | Rice's theorem | Download |
| 37 | Introduction to Computational Complexity Theory | Download |
| 38 | More on the class NP | Download |
| 39 | NP-Completeness | Download |
| 40 | More on NP-Completeness | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Introduction to Finite Automata | Download To be verified |
| 2 | Basic Notation and Convention, DFA Edit Lesson | Download To be verified |
| 3 | Example of DFAs | Download To be verified |
| 4 | Computation by DFA and Regular operation | Download To be verified |
| 5 | Introduction to Nondeterminism | Download To be verified |
| 6 | NFA, definition and examples | Download To be verified |
| 7 | Equivalence of NFA and DFA, Closure properties | Download To be verified |
| 8 | Regular expressions | Download To be verified |
| 9 | Algebraic properties, RE to NFA conversion | Download To be verified |
| 10 | GNFA to RE conversion | Download To be verified |
| 11 | More closure properties of regular languages | Download To be verified |
| 12 | Non-regular languages and pumping lemma | Download To be verified |
| 13 | Examples of non-regular languages | Download To be verified |
| 14 | DFA minimization | Download To be verified |
| 15 | Introduction to CFGs | Download To be verified |
| 16 | Examples of CFGs, Reg subset of CFL | Download To be verified |
| 17 | Parse tree, derivation, ambiguity | Download To be verified |
| 18 | Normal forms, Chomsky normal form | Download To be verified |
| 19 | Non-CFLs, pumping lemma | Download To be verified |
| 20 | Examples of non- CFLs | Download To be verified |
| 21 | Pushdown Automata | Download To be verified |
| 22 | Pushdown Automata - Definition and Example | Download To be verified |
| 23 | Pushdown Automata - Examples and Relation with CFGs | Download To be verified |
| 24 | Closure Properties of CFLs | Download To be verified |
| 25 | Deterministic Context Free Languages | Download To be verified |
| 26 | Turing Machine | Download To be verified |
| 27 | More on Turing Machine | Download To be verified |
| 28 | Non deterministic Turing Machine Edit Lesson | Download To be verified |
| 29 | Configuration Graphs | Download To be verified |
| 30 | Closure Properties of Decidable and Turing recognizable languages | Download To be verified |
| 31 | Decidability properties of Regular and Context Free Languages | Download To be verified |
| 32 | Undecidability | Download To be verified |
| 33 | More on Undecidability | Download To be verified |
| 34 | Reduction | Download To be verified |
| 35 | Applications of Reduction | Download To be verified |
| 36 | Rice's theorem | Download To be verified |
| 37 | Introduction to Computational Complexity Theory | Download To be verified |
| 38 | More on the class NP | Download To be verified |
| 39 | NP-Completeness | Download To be verified |
| 40 | More on NP-Completeness | 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 |