| 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 |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | An Introduction to The Theory of Computation | PDF unavailable |
| 2 | Notations and Terminology in Theory of Computation | PDF unavailable |
| 3 | An Introduction to Finite Automata and Regular Languages - Part 01 | PDF unavailable |
| 4 | An Introduction to Finite Automata and Regular Languages - Part 02 | PDF unavailable |
| 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 |
| 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 |