Module NameDownload

Sl.No Chapter Name English
1IntroductionPDF unavailable
2Alphabet, Strings, LanguagesPDF unavailable
3Finite Representation PDF unavailable
4Grammars (CFG) PDF unavailable
5Derivation TreesPDF unavailable
6Regular GrammarsPDF unavailable
7Finite AutomataPDF unavailable
8Nondeterministic Finite AutomataPDF unavailable
9NFA <=> DFAPDF unavailable
10Myhill-Nerode TheoremPDF unavailable
11MinimizationPDF unavailable
12RE => FAPDF unavailable
13FA => REPDF unavailable
14FA <=> RGPDF unavailable
15Variants of FAPDF unavailable
16Closure Properties of RLPDF unavailable
17HomomorphismPDF unavailable
18Pumping LemmaPDF unavailable
19Simplification of CFGPDF unavailable
20Normal Forms of CFGPDF unavailable
21Properties of CFLsPDF unavailable
22Pushdown AutomataPDF unavailable
23PDA <=> CFGPDF unavailable
24Turing MachinesPDF unavailable
25Turing Computable FunctionsPDF unavailable
26Combining Turing MachinesPDF unavailable
27Multi InputPDF unavailable
28Turing Decidable LanguagesPDF unavailable
29Varients of Turing MachinesPDF unavailable
30Structured GrammarsPDF unavailable
31DecidabilityPDF unavailable
32Undecidability1PDF unavailable
33Undecidability2PDF unavailable
34Undecidability3PDF unavailable
35Time Bounded Turing MachinesPDF unavailable
36P and NPPDF unavailable
37NP-CompletenessPDF unavailable
38NP-Complete Problems1PDF unavailable
39NP-Complete Problems2PDF unavailable
40NP-Complete Problems3PDF unavailable
41Chomsky HierarchyPDF unavailable


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