Back To The Course Mod-01 Lec-01 What is theory of computation? Free Video Tutorials and Notes Lectures Mod-01 Lec-02 Introduction to finite automaton. Free Video Tutorials and Notes Lectures Mod-01 Lec-03 Finite automata continued, deterministic finite automata(DFAs), Free Video Tutorials and Notes Lectures Mod-01 Lec-04 Regular languages, their closure properties. Free Video Tutorials and Notes Lectures Mod-01 Lec-05 DFAs solve set membership problems in linear time, pumping lemma. Free Video Tutorials and Notes Lectures Mod-01 Lec-06 More examples of nonregular languages, proof of pumping lemma Free Video Tutorials and Notes Lectures Mod-01 Lec-07 A generalization of pumping lemma, nondeterministic finite automata (NFAs) Free Video Tutorials and Notes Lectures Mod-01 Lec-13 Closure properties continued. Free Video Tutorials and Notes Lectures Mod-01 Lec-14 Closure under reversal, use of closure properties. Free Video Tutorials and Notes Lectures Mod-01 Lec-15 Decision problems for regular languages. Free Video Tutorials and Notes Lectures Mod-01 Lec-08 Formal description of NFA, language accepted by NFA, such languages are also regular. Free Video Tutorials and Notes Lectures Mod-01 Lec-11 Regular expressions, they denote regular languages. Free Video Tutorials and Notes Lectures Mod-01 Lec-12 Construction of a regular expression for a language given a DFA accepting it. Free Video Tutorials and Notes Lectures Mod-01 Lec-16 About minimization of states of DFAs. Myhill-Nerode theorem. Free Video Tutorials and Notes Lectures Mod-01 Lec-17 Continuation of proof of Myhill-Nerode theorem. Free Video Tutorials and Notes Lectures Mod-01 Lec-18 Application of Myhill-Nerode theorem. DFA minimization. Free Video Tutorials and Notes Lectures Mod-01 Lec-19 DFA minimization continued. Free Video Tutorials and Notes Lectures Mod-01 Lec-20 Introduction to context free languages (cfls) Free Video Tutorials and Notes Lectures Mod-01 Lec-21 Languages generated by a cfg, leftmost derivation, more examples of cfgs and cfls. Free Video Tutorials and Notes Lectures Mod-01 Lec-22 Parse trees, inductive proof that L is L(G). All regular languages are context free. Free Video Tutorials and Notes Lectures Mod-01 Lec-23 Towards Chomsky normal forms: elimination of useless symbols Free Video Tutorials and Notes Lectures Mod-01 Lec-24 Simplification of cfgs continued, Removal of epsilon productions Free Video Tutorials and Notes Lectures Mod-01 Lec-25 Elimination of unit productions. Converting a cfg into Chomsky normal form. Free Video Tutorials and Notes Lectures Computer Science - Theory of Computation Free Video Tutorials and Notes LecturesMod-01 Lec-01 What is theory of computation? Free Video Tutorials and Notes LecturesTheory of Computation by Prof. Somenath Biswas,Computer Science and Engineering, IIT Kanpur.For more details on NPTEL visit http://nptel.ac.in