Sl.No Chapter Name MP4 Download
1An Introduction to The Theory of ComputationDownload
2Notations and Terminology in Theory of ComputationDownload
3An Introduction to Finite Automata and Regular Languages - Part 01Download
4An Introduction to Finite Automata and Regular Languages - Part 02Download
5Significance of Regular Languages and Regular OperationsDownload
6Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 01Download
7Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 02Download
8An Introduction to Non-Deterministic Finite Automata (NFA)Download
9Formal Definitions and Examples of Non-Deterministic Finite Automata(NFA)Download
10Equivalence of NFA and DFADownload
11Closure of Regular Languages Under Regular Operations(Using NFA)Download
12Regular Expressions - Part 01Download
13Regular Expressions - Part 02Download
14Proving Equivalence of Regular Expression and DFA Through a GNFADownload
15Pumping Lemma for Regular Languages - Part 01Download
16Pumping Lemma for Regular Languages - Part 02Download
17Distinguishability of Strings and Myhill-Nerode TheoremDownload
18Proving the Myhill-Nerode TheoremDownload
19An Introduction to Context-Free Languages - Part 01Download
20An Introduction to Context-Free Languages - Part 02 Download

Sl.No Chapter Name English
1An Introduction to The Theory of ComputationPDF unavailable
2Notations and Terminology in Theory of ComputationPDF unavailable
3An Introduction to Finite Automata and Regular Languages - Part 01PDF unavailable
4An Introduction to Finite Automata and Regular Languages - Part 02PDF unavailable
5Significance of Regular Languages and Regular OperationsPDF unavailable
6Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 01PDF unavailable
7Closure Properties of Regular Languages Under Union, Concatenation and Kleene Star Operation-Part 02PDF unavailable
8An Introduction to Non-Deterministic Finite Automata (NFA)PDF unavailable
9Formal Definitions and Examples of Non-Deterministic Finite Automata(NFA)PDF unavailable
10Equivalence of NFA and DFAPDF unavailable
11Closure of Regular Languages Under Regular Operations(Using NFA)PDF unavailable
12Regular Expressions - Part 01PDF unavailable
13Regular Expressions - Part 02PDF unavailable
14Proving Equivalence of Regular Expression and DFA Through a GNFAPDF unavailable
15Pumping Lemma for Regular Languages - Part 01PDF unavailable
16Pumping Lemma for Regular Languages - Part 02PDF unavailable
17Distinguishability of Strings and Myhill-Nerode TheoremPDF unavailable
18Proving the Myhill-Nerode TheoremPDF unavailable
19An Introduction to Context-Free Languages - Part 01PDF unavailable
20An Introduction to Context-Free Languages - Part 02 PDF unavailable


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