Module Name | Download | Description | Download Size |
---|---|---|---|
Grammars: Properties of Context Free Grammars | Grammars | Introduction to Formal Languages,Automata and Computability | 593 |
Finite State Automata and Regular Expressions | FSA | Introduction to Formal Languages,Automata and Computability | 389 |
Finite State Automata and Regular Expressions | FSAcontd-I | Finite State Automata : Characterization, Propertiesand Decidability | 211 |
Finite State Automata and Regular Expressions | FSAcontd-II | Finite State Automata : Output and Minimization | 192 |
Pushdown Automata | PDA | Pushdown Automaton,Empty Store and Acceptance by Final State,Equivalence of CFG and PDA | 319 |
Pushdown Automata | Properties of CFL | Context-Free Grammars - Properties and Parsing | 343 |
Turing Machines | Turing Machines | Turing Machine as an Acceptor,Turing Machine as a Computing Device,Copy machine,Techniques for Turing Machine Construction | 409 |
Turing Machines | Variations of Turing Machines | TM's with two-way infinite tapes,Multitape TM, Multihead TM ,Nondeterministic TM,TM with two-dimensional Tapes. | 746 |
Advanced Topics | Grammar Systems | Grammar Systems and Distributed Automata,CD Grammar Systems,PC Grammar systems | 157 |
Advanced Topics | Lindenmayer Systems | Lindenmayer Systems,Extended System,Systems with Interactions,Fractals Generated by L-Systems,Generation of Plant Structure | 400 |
Advanced Topics | Regulated Re-writing | Regulated Re-writing,Matrix Grammar,Programmed Grammar,Random Context grammar,Time varying Grammar,Regular Control Grammars,Indian Parallel Grammars. | 125 |
New Paradigms of Computing | DNA Computing | Motivation,About DNA,Adleman's experiment,Lipton's solution for satisfiability,Universality,Main considerations | 812 |
New Paradigms of Computing | Membrane Computing | Models of Computing,Membrane Systems,Motivation,Our Contribution,Future Direction | 333 |
New Paradigms of Computing | Recent Trends in Formal Language Theory.pdf | Introduction,Historical Development,Recent Trends and Application. | 1088 |
Module Name | Download | Description | Download Size |
---|---|---|---|
Grammars: Properties of Context Free Grammars | Multiple Choice Questions-II | Multiple Choice Questions for First seven Modules. | 302 |
Grammars: Properties of Context Free Grammars | Multiple Choice Questions-I | Multiple Choice Questions for First Seven Modules. | 444 |
Sl.No | Chapter Name | English |
---|---|---|
1 | GRAMMARS AND NATURAL LANGUAGE PROCESSING | PDF unavailable |
2 | GRAMMARS AND LANGUAGES GENERATED | PDF unavailable |
3 | GRAMMARS AND LANGUAGES GENERATED (Contd) | PDF unavailable |
4 | AMBIGUITY IN CFG | PDF unavailable |
5 | SIMPLICATION OF CFG | PDF unavailable |
6 | REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG | PDF unavailable |
7 | GREIBACH NORMAL FORM FOR CFG | PDF unavailable |
8 | FINAL STATE AUTOMATA | PDF unavailable |
9 | NON DETERMINISTIC FSA | PDF unavailable |
10 | NON DETERMINISTIC FSA (Contd) | PDF unavailable |
11 | NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES | PDF unavailable |
12 | EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS | PDF unavailable |
13 | REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA | PDF unavailable |
14 | DFSA TO REGULAR EXPRESSIONS | PDF unavailable |
15 | PROBLEMS AND SOLUTIONS-I | PDF unavailable |
16 | PUMPING LEMMAS FOR REGULAR SETS AND CFL | PDF unavailable |
17 | MYHILL - NERODE THEOREM | PDF unavailable |
18 | MINIMIZATION OF DFSA | PDF unavailable |
19 | FSA WITH OUTPUT MOORE AND MEALY MACHINES | PDF unavailable |
20 | PUSHDOWN AUTOMATA | PDF unavailable |
21 | PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE | PDF unavailable |
22 | PUSHDOWN AUTOMATA CFG TO PDA | PDF unavailable |
23 | PUSHDOWN AUTOMATA PDA TO CFG | PDF unavailable |
24 | PROBLEMS AND SOLUTIONS-II | PDF unavailable |
25 | PROBLEMS AND SOLUTIONS - III | PDF unavailable |
26 | TURING MACHINES | PDF unavailable |
27 | TURING MACHINES (Contd) | PDF unavailable |
28 | TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTION | PDF unavailable |
29 | GENERALIZED VERSIONS OF TURING MACHINES | PDF unavailable |
30 | TURING MACHINE AS A GENERATING DEVICE | PDF unavailable |
31 | RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM | PDF unavailable |
32 | PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY | PDF unavailable |
33 | RICE'S THEOREM , LINEAR BOUNDED AUTOMATA , PROPERTIES OF TM | PDF unavailable |
34 | POST'S CORRESPONDENCE PROBLEMS | PDF unavailable |
35 | POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM | PDF unavailable |
36 | NP - COMPLETE PROBLEMS , COOK'S THEOREM | PDF unavailable |
37 | NP - COMPLETE PROBLEMS (Contd) | PDF unavailable |
38 | REGULATED REWRITING | PDF unavailable |
39 | L - SYSTEMS | PDF unavailable |
40 | GRAMMAR SYSTEMS | PDF unavailable |
41 | DNA COMPUTING | PDF unavailable |
42 | MEMBRANE COMPUTING | 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 |