Theory Of Computation : MCA-201

Lecture No. Description Watch Videos
Lecture 1 Overview of Theoretical Computer Science Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 2 Introduction to System software including various phases/Modules in the design of a typical compiler Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 3 Chomsky Classification, Finite Automata,Deterministic Finite Automata (DFA) Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 4 Non-Deterministic Finite Automata (NFA) Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 5 Statement of Kleen’s Theorem, Regular Expressions Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 6 Equivalence of DFAs, NFAs and Regular Expressions Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 7 Equivalence of DFAs, NFAs Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 8 Regular Expressions Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 9 Closure properties of Regular Language, Non-Regular Languages, Pumping Lemma Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 10 MyhillNerode Theorem Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 11 Use of Regular expressions in the Design of scanner (lexical analyzer) Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 12 Introduction to JFLAP Simulation. Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 13 Context Free Grammar (CFG), Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 14 Context Free Grammar (CFG), Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 15 Parse Trees Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 16 Parse Trees Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 17 Push Down Automata (deterministic and nondeterministic) (PDA)-1 Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 18 Push Down Automata (deterministic and nondeterministic) (PDA)-2 Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 19 Equivalence of CFGs and PDAs Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 20 Closure properties of CFLs Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 21 Pumping Lemma Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 22 Parsing ( including LL(1) , SLR and LR(1) Parsing Method) Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 23 Parsing ( including SLR) Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 24 Parsing ( including LR(1)) Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 25 Definition of Turing Machine Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 26 Extensions of Turing Machines-1 Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 27 Extensions of Turing Machines-2 Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 28 Non – deterministic Turing machines Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 29 Equivalence of various Turing Machine Formalism’s-1 Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 30 Equivalence of various Turing Machine Formalism’s-2 Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 31 Decidability Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 32 Church – Turing Thesis Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 33 Halting Problem Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 34 Reducibility Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 35 Recursion Theorem Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 36 Time and Space measures Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 37 Hierarchy theorems Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 38 Complexity classes P Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 39 NP Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 40 Space complexity Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 41 Savich theorem Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 42 L, NL, PSPACE complexity Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 43 Post correspondence problem Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 44 Probabilistic computation Lecture by ,    Lecture by ,    Lecture by ,    Lecture by
Lecture 45 PSPACE complexity Lecture by ,    Lecture by ,    Lecture by ,    Lecture by