Modules / Lectures
Module NameDownloadDescriptionDownload Size
Grammars: Properties of Context Free GrammarsGrammarsIntroduction to Formal Languages,Automata and Computability593
Finite State Automata and Regular ExpressionsFSAIntroduction to Formal Languages,Automata and Computability389
Finite State Automata and Regular ExpressionsFSAcontd-IFinite State Automata : Characterization, Propertiesand Decidability211
Finite State Automata and Regular ExpressionsFSAcontd-IIFinite State Automata : Output and Minimization192
Pushdown AutomataPDAPushdown Automaton,Empty Store and Acceptance by Final State,Equivalence of CFG and PDA319
Pushdown AutomataProperties of CFLContext-Free Grammars - Properties and Parsing343
Turing MachinesTuring MachinesTuring Machine as an Acceptor,Turing Machine as a Computing Device,Copy machine,Techniques for Turing Machine Construction409
Turing MachinesVariations of Turing MachinesTM's with two-way infinite tapes,Multitape TM, Multihead TM ,Nondeterministic TM,TM with two-dimensional Tapes.746
Advanced TopicsGrammar SystemsGrammar Systems and Distributed Automata,CD Grammar Systems,PC Grammar systems157
Advanced TopicsLindenmayer SystemsLindenmayer Systems,Extended System,Systems with Interactions,Fractals Generated by L-Systems,Generation of Plant Structure400
Advanced TopicsRegulated Re-writingRegulated Re-writing,Matrix Grammar,Programmed Grammar,Random Context grammar,Time varying Grammar,Regular Control Grammars,Indian Parallel Grammars.125
New Paradigms of ComputingDNA ComputingMotivation,About DNA,Adleman's experiment,Lipton's solution for satisfiability,Universality,Main considerations812
New Paradigms of ComputingMembrane ComputingModels of Computing,Membrane Systems,Motivation,Our Contribution,Future Direction333
New Paradigms of ComputingRecent Trends in Formal Language Theory.pdfIntroduction,Historical Development,Recent Trends and Application.1088
Module NameDownloadDescriptionDownload Size
Grammars: Properties of Context Free GrammarsMultiple Choice Questions-IIMultiple Choice Questions for First seven Modules.302
Grammars: Properties of Context Free GrammarsMultiple Choice Questions-IMultiple Choice Questions for First Seven Modules.444


Sl.No Chapter Name MP4 Download
1GRAMMARS AND NATURAL LANGUAGE PROCESSINGDownload
2GRAMMARS AND LANGUAGES GENERATEDDownload
3GRAMMARS AND LANGUAGES GENERATED (Contd)Download
4AMBIGUITY IN CFGDownload
5SIMPLICATION OF CFGDownload
6REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFGDownload
7GREIBACH NORMAL FORM FOR CFGDownload
8FINAL STATE AUTOMATA Download
9NON DETERMINISTIC FSADownload
10NON DETERMINISTIC FSA (Contd)Download
11NON DETERMINISTIC FSA WITH E(Epsilon)- MOVESDownload
12EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARSDownload
13REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA Download
14DFSA TO REGULAR EXPRESSIONS Download
15PROBLEMS AND SOLUTIONS-IDownload
16PUMPING LEMMAS FOR REGULAR SETS AND CFLDownload
17MYHILL - NERODE THEOREM Download
18MINIMIZATION OF DFSA Download
19FSA WITH OUTPUT MOORE AND MEALY MACHINES Download
20PUSHDOWN AUTOMATA Download
21PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE Download
22PUSHDOWN AUTOMATA CFG TO PDA Download
23PUSHDOWN AUTOMATA PDA TO CFGDownload
24PROBLEMS AND SOLUTIONS-IIDownload
25PROBLEMS AND SOLUTIONS - IIIDownload
26TURING MACHINES Download
27TURING MACHINES (Contd)Download
28TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTIONDownload
29GENERALIZED VERSIONS OF TURING MACHINES Download
30TURING MACHINE AS A GENERATING DEVICE Download
31RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEMDownload
32PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY Download
33RICE'S THEOREM , LINEAR BOUNDED AUTOMATA , PROPERTIES OF TMDownload
34POST'S CORRESPONDENCE PROBLEMSDownload
35POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM Download
36NP - COMPLETE PROBLEMS , COOK'S THEOREMDownload
37NP - COMPLETE PROBLEMS (Contd)Download
38REGULATED REWRITING Download
39L - SYSTEMS Download
40GRAMMAR SYSTEMS Download
41DNA COMPUTING Download
42MEMBRANE COMPUTING Download

Sl.No Chapter Name English
1GRAMMARS AND NATURAL LANGUAGE PROCESSINGPDF unavailable
2GRAMMARS AND LANGUAGES GENERATEDPDF unavailable
3GRAMMARS AND LANGUAGES GENERATED (Contd)PDF unavailable
4AMBIGUITY IN CFGPDF unavailable
5SIMPLICATION OF CFGPDF unavailable
6REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFGPDF unavailable
7GREIBACH NORMAL FORM FOR CFGPDF unavailable
8FINAL STATE AUTOMATA PDF unavailable
9NON DETERMINISTIC FSAPDF unavailable
10NON DETERMINISTIC FSA (Contd)PDF unavailable
11NON DETERMINISTIC FSA WITH E(Epsilon)- MOVESPDF unavailable
12EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARSPDF unavailable
13REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA PDF unavailable
14DFSA TO REGULAR EXPRESSIONS PDF unavailable
15PROBLEMS AND SOLUTIONS-IPDF unavailable
16PUMPING LEMMAS FOR REGULAR SETS AND CFLPDF unavailable
17MYHILL - NERODE THEOREM PDF unavailable
18MINIMIZATION OF DFSA PDF unavailable
19FSA WITH OUTPUT MOORE AND MEALY MACHINES PDF unavailable
20PUSHDOWN AUTOMATA PDF unavailable
21PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE PDF unavailable
22PUSHDOWN AUTOMATA CFG TO PDA PDF unavailable
23PUSHDOWN AUTOMATA PDA TO CFGPDF unavailable
24PROBLEMS AND SOLUTIONS-IIPDF unavailable
25PROBLEMS AND SOLUTIONS - IIIPDF unavailable
26TURING MACHINES PDF unavailable
27TURING MACHINES (Contd)PDF unavailable
28TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTIONPDF unavailable
29GENERALIZED VERSIONS OF TURING MACHINES PDF unavailable
30TURING MACHINE AS A GENERATING DEVICE PDF unavailable
31RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEMPDF unavailable
32PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY PDF unavailable
33RICE'S THEOREM , LINEAR BOUNDED AUTOMATA , PROPERTIES OF TMPDF unavailable
34POST'S CORRESPONDENCE PROBLEMSPDF unavailable
35POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM PDF unavailable
36NP - COMPLETE PROBLEMS , COOK'S THEOREMPDF unavailable
37NP - COMPLETE PROBLEMS (Contd)PDF unavailable
38REGULATED REWRITING PDF unavailable
39L - SYSTEMS PDF unavailable
40GRAMMAR SYSTEMS PDF unavailable
41DNA COMPUTING PDF unavailable
42MEMBRANE COMPUTING 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