| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | An Introduction to The Theory of Computation | Download |
| 2 | Notations and Terminology in Theory of Computation | Download |
| 3 | An Introduction to Finite Automata and Regular Languages - Part 01 | Download |
| 4 | An Introduction to Finite Automata and Regular Languages - Part 02 | Download |
| 5 | Significance of Regular Languages and Regular Operations | Download |
| 6 | Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 01 | Download |
| 7 | Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 02 | Download |
| 8 | An Introduction to Non-Deterministic Finite Automata (NFA) | Download |
| 9 | Formal Definitions and Examples of Non-Deterministic Finite Automata(NFA) | Download |
| 10 | Equivalence of NFA and DFA | Download |
| 11 | Closure of Regular Languages Under Regular Operations(Using NFA) | Download |
| 12 | Regular Expressions - Part 01 | Download |
| 13 | Regular Expressions - Part 02 | Download |
| 14 | Proving Equivalence of Regular Expression and DFA Through a GNFA | Download |
| 15 | Pumping Lemma for Regular Languages - Part 01 | Download |
| 16 | Pumping Lemma for Regular Languages - Part 02 | Download |
| 17 | Distinguishability of Strings and Myhill-Nerode Theorem | Download |
| 18 | Proving the Myhill-Nerode Theorem | Download |
| 19 | An Introduction to Context-Free Languages - Part 01 | Download |
| 20 | An Introduction to Context-Free Languages - Part 02 | Download |
| 21 | Equivalence of Context Free Grammars and Push Down Automata - Part 01 | Download |
| 22 | Equivalence of Context Free Grammars and Push Down Automata - Part 02 | Download |
| 23 | Equivalence of Context Free Grammars and Push Down Automata - Part 03 | Download |
| 24 | Pumping Lemma for Context Free Languages | Download |
| 25 | Examples of Pumping Lemma Usage for Context Free Languages | Download |
| 26 | Formal Definition of a Turing Machine | Download |
| 27 | Turing Recognizable & Decidable Languages and TM Examples | Download |
| 28 | Multitape Turing Machine | Download |
| 29 | Non-Deterministic Turing Machines | Download |
| 30 | Equivalence of Deterministic and Nondeterministic TM | Download |
| 31 | Church-Turing Thesis | Download |
| 32 | Decidable Problems Concerning Regular Languages | Download |
| 33 | Decidable Problems Concerning Context Free Languages | Download |
| 34 | Countability of Sets | Download |
| 35 | Proof of Existence of Undecidable Languages | Download |
| 36 | Halting Problem | Download |
| 37 | Co-Turing Recognizability | Download |
| 38 | An Introduction to Mapping Reducibility | Download |
| 39 | Examples of Proving Undecidability Using Reductions | Download |
| 40 | Rice Theorem | Download |
| 41 | Computation Histories | Download |
| 42 | The Post Correspondence Problem | Download |
| 43 | Checking Ambiguity in CFG is Undecidable | Download |
| 44 | Time Complexity - Part 1 | Download |
| 45 | Time Complexity - Part 2 | Download |
| 46 | Non-Deterministic Polynomial Time - Part 1 | Download |
| 47 | Non-Deterministic Polynomial Time - Part 2 | Download |
| 48 | Verifiability and NP | Download |
| 49 | Polynomial Time Reductions - Part 1 | Download |
| 50 | Polynomial Time Reductions - Part 2 | Download |
| 51 | NP-Completeness | Download |
| 52 | Cook-Levin Theorem | Download |
| 53 | Cook-Levin Theorem - Proof and Implications | Download |
| 54 | CLIQUE and VERTEX-COVER is NP-Complete | Download |
| 55 | HAM-PATH is NP-Complete | Download |
| 56 | SUBSET-SUM is NP-Complete | Download |
| 57 | Knapsack Problem | Download |
| 58 | Integer Linear Program is NP-Complete | Download |
| 59 | Space Complexity and its Complexity Classes | Download |
| 60 | Logspace Reductions and NL-Completeness | Download |
| 61 | Savitch's theorem | Download |
| 62 | Results in Space Complexity | Download |
| 63 | Summary and Concluding Remarks | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | An Introduction to The Theory of Computation | Download Verified |
| 2 | Notations and Terminology in Theory of Computation | Download Verified |
| 3 | An Introduction to Finite Automata and Regular Languages - Part 01 | Download Verified |
| 4 | An Introduction to Finite Automata and Regular Languages - Part 02 | Download Verified |
| 5 | Significance of Regular Languages and Regular Operations | PDF unavailable |
| 6 | Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 01 | PDF unavailable |
| 7 | Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 02 | PDF unavailable |
| 8 | An Introduction to Non-Deterministic Finite Automata (NFA) | PDF unavailable |
| 9 | Formal Definitions and Examples of Non-Deterministic Finite Automata(NFA) | PDF unavailable |
| 10 | Equivalence of NFA and DFA | PDF unavailable |
| 11 | Closure of Regular Languages Under Regular Operations(Using NFA) | PDF unavailable |
| 12 | Regular Expressions - Part 01 | PDF unavailable |
| 13 | Regular Expressions - Part 02 | PDF unavailable |
| 14 | Proving Equivalence of Regular Expression and DFA Through a GNFA | PDF unavailable |
| 15 | Pumping Lemma for Regular Languages - Part 01 | PDF unavailable |
| 16 | Pumping Lemma for Regular Languages - Part 02 | PDF unavailable |
| 17 | Distinguishability of Strings and Myhill-Nerode Theorem | PDF unavailable |
| 18 | Proving the Myhill-Nerode Theorem | PDF unavailable |
| 19 | An Introduction to Context-Free Languages - Part 01 | PDF unavailable |
| 20 | An Introduction to Context-Free Languages - Part 02 | PDF unavailable |
| 21 | Equivalence of Context Free Grammars and Push Down Automata - Part 01 | PDF unavailable |
| 22 | Equivalence of Context Free Grammars and Push Down Automata - Part 02 | PDF unavailable |
| 23 | Equivalence of Context Free Grammars and Push Down Automata - Part 03 | PDF unavailable |
| 24 | Pumping Lemma for Context Free Languages | PDF unavailable |
| 25 | Examples of Pumping Lemma Usage for Context Free Languages | PDF unavailable |
| 26 | Formal Definition of a Turing Machine | PDF unavailable |
| 27 | Turing Recognizable & Decidable Languages and TM Examples | PDF unavailable |
| 28 | Multitape Turing Machine | PDF unavailable |
| 29 | Non-Deterministic Turing Machines | PDF unavailable |
| 30 | Equivalence of Deterministic and Nondeterministic TM | PDF unavailable |
| 31 | Church-Turing Thesis | PDF unavailable |
| 32 | Decidable Problems Concerning Regular Languages | PDF unavailable |
| 33 | Decidable Problems Concerning Context Free Languages | PDF unavailable |
| 34 | Countability of Sets | PDF unavailable |
| 35 | Proof of Existence of Undecidable Languages | PDF unavailable |
| 36 | Halting Problem | PDF unavailable |
| 37 | Co-Turing Recognizability | PDF unavailable |
| 38 | An Introduction to Mapping Reducibility | PDF unavailable |
| 39 | Examples of Proving Undecidability Using Reductions | PDF unavailable |
| 40 | Rice Theorem | PDF unavailable |
| 41 | Computation Histories | PDF unavailable |
| 42 | The Post Correspondence Problem | PDF unavailable |
| 43 | Checking Ambiguity in CFG is Undecidable | PDF unavailable |
| 44 | Time Complexity - Part 1 | PDF unavailable |
| 45 | Time Complexity - Part 2 | PDF unavailable |
| 46 | Non-Deterministic Polynomial Time - Part 1 | PDF unavailable |
| 47 | Non-Deterministic Polynomial Time - Part 2 | PDF unavailable |
| 48 | Verifiability and NP | PDF unavailable |
| 49 | Polynomial Time Reductions - Part 1 | PDF unavailable |
| 50 | Polynomial Time Reductions - Part 2 | PDF unavailable |
| 51 | NP-Completeness | PDF unavailable |
| 52 | Cook-Levin Theorem | PDF unavailable |
| 53 | Cook-Levin Theorem - Proof and Implications | PDF unavailable |
| 54 | CLIQUE and VERTEX-COVER is NP-Complete | PDF unavailable |
| 55 | HAM-PATH is NP-Complete | PDF unavailable |
| 56 | SUBSET-SUM is NP-Complete | PDF unavailable |
| 57 | Knapsack Problem | PDF unavailable |
| 58 | Integer Linear Program is NP-Complete | PDF unavailable |
| 59 | Space Complexity and its Complexity Classes | PDF unavailable |
| 60 | Logspace Reductions and NL-Completeness | PDF unavailable |
| 61 | Savitch's theorem | PDF unavailable |
| 62 | Results in Space Complexity | PDF unavailable |
| 63 | Summary and Concluding Remarks | PDF unavailable |
| 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 |