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

Important: Please enable javascript in your browser and download Adobe Flash player to view this site
Site Maintained by Web Studio, IIT Madras. Contact Webmaster: nptel@iitm.ac.in