Theory of Computation (Hindi) (Part 2)

   Sunday, May 05, 2024   

Starting a new Lecture Notes Series on Theory of Computation

Youtube Lecture Playlist Credits 

Channel Name: THE GATEHUB

So Let Us Start to This Journey of Learning 

Theory of Computation By Lecture Notes together!

Lecture 61: Simplification of Context Free Grammar ( Reduction of CFG) |Automata Theory

Lecture 62: Removal of Null Production | Simplification of CFG | Elimination of Epsilon production | TOC

Lecture 63: Removal of Unit Production | Simplification of CFG | Elimination of Unit production | TOC

Lecture 64: Removal of Useless Production | Simplification of CFG | Elimination of Useless production | TOC

Lecture 65: Chomsky Normal Form | CNF | CNF with examples | TOC | Automata Theory

Lecture 66: CFG to CNF Conversion Examples | Chomsky Normal Form Examples | TOC | Automata Theory

Lecture 67: CYK Algorithm | Membership algorithm for CFG | GATECSE | TOC

Lecture 68: Greibach Normal Form (GNF) | GNF Solved Examples | TOC | GATECS | Automata Theory

Lecture 69: CFG to GNF Conversion | Context Free Grammar to Greibach Normal Form Conversion | GATECS | TOC

Lecture 70: CYK Algorithm | Membership algorithm for CFG | GATECSE | TOC

Lecture 71: Greibach Normal Form (GNF) | GNF Solved Examples | TOC | GATECS | Automata Theory

Lecture 72: CFG to GNF Conversion | Context Free Grammar to Greibach Normal Form Conversion | GATECS | TOC

Lecture 73: Pushdown Automata for a^n b^n c^m and a^n b^m c^n |Theory of Computation | TOC | Automata Theory

Lecture 74: Pushdown Automata (PDA) for a^m+n b^n c^m | a^n b^m+n c^m | a^n b^m c^m+n | Automata Theory

Lecture 75: Pushdown Automata (PDA) for WCW^r | Odd Palindrome | Theory of Computation | Automata Theory

Lecture 76: Pushdown Automata (PDA) for WW^r | NPDA for WW^r | Even Palindrome | TOC | Automata Theory

Lecture 77: Pushdown Automata for L=a^n b^2n | PDA for a^n b^2n | Theory of Computation | TOC | Automata Theory

Lecture 78: PDA for L= a^n b^n UNION a^n b^2n | L= a^n b^n UNION a^n b^2n | Theory of Computation

Lecture 79: How to check whether a language is cfl or not | CFL, DCFL and Non-CFL | GATECSE | TOC

Lecture 80: Two Stack PDA | 2 stack PDA for a^n b^n c^n | TOC | Automata Theory

Lecture 81: Two Stack PDA | 2 stack PDA for a^n b^n c^n d^n | TOC | Automata Theory

Lecture 82: CFG to PDA Conversion | Equivalence of CFG and PDA| TOC | Automata Theory

Lecture 83: PDA to CFG Conversion | equivalence of CFG and PDA | TOC | Automata Theory

Lecture 84: Turing machine for a^n b^n | Turing Machine | Theory of Computation | TOC |Automata Theory

Lecture 85: Turing Machine for L= a^n b^n c^n | Turing Machine | Automata Theory

Lecture 86: Turing Machine for Regular Language | Turing Machine | GATECSE | TOC

Lecture 87: Turing Machine for ww^r | Turing Machine for Even Palindrome | GATECSE | TOC

Lecture 88: Turing Machine for Odd Palindrome | waw^r | wbw^r | GATECSE | TOC

Lecture 89: Turing Machine for wcw | L= wcw | w belongs to (a,b)* | GATECSE | TOC

Lecture 90: Turing Machine for 1's complement | 2's complement | Turing Machine | Turing Machine as a Transducer

Lecture 91: Turing Machine for addition | Turing machine for addition of two numbers | GATECSE | TOC

Lecture 92: Turing Machine For Multiplication|TM for Multiply of two Number|Unary|Turing Machine| GATECSE | TOC

Lecture 93: Turing Machine as a Comparator | How Turing Machine do Comparison | GATECSE | TOC

Lecture 94: Turing Machine for Subtraction of two Number | Turing Machine | GATECSE | TOC

Lecture 95: Introduction to Turing Machine | Formal Definition of Turing Machine | Automata Theory

Lecture 96: Variation of Turing Machine | Turing Machine | Automata Theory

Lecture 97: Recursive and Recursive Enumerable Languages in Theory of Computation | GATECSE | TOC

Lecture 98: Church-Turing Thesis in Theory of Computation | Turing Machine | GATECSE | TOC

Lecture 99: Universal Turing Machine | Binary encoding of turing machine | GATECSE | TOC

Lecture 100: Recursive and Recursive Enumerable Languages in Theory of Computation | GATECSE | TOC

Lecture 101: Church-Turing Thesis in Theory of Computation | Turing Machine | GATECSE | TOC

Lecture 102: Universal Turing Machine | Binary encoding of turing machine | GATECSE | TOC

Lecture 103: Countability Example 3 (set of all strings over sigma are countable) | TOC | Automata Theory

Lecture 104: Countability Example 4 (set of all turing machine's are countable) | TOC | Automata Theory

Lecture 105: Diagonalization Method (set of all languages are uncountable) | Countability | TOC | Automata Theory

Lecture 106: Operation on countable set (Union and Cartesian product ) | TOC | Automata Theory

Lecture 107: Closure Properties of Regular Language | GATECSE | TOC

Lecture 108: Reversal of Regular Language | Closure Properties of Regular Language | GATECSE | TOC

Lecture 109: Homomorphism in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC

Lecture 110: Inverse Homomorphism in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC

Lecture 111: Substitution in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC

Lecture 112: INIT Operation in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC

Lecture 113: Quotient Operation in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC

Lecture 114: Infinite Union and Subset in Regular Languages | Closure Properties of Regular Language | TOC

Lecture 115: Closure Properties of Context Free Language | Union | Concatenation | GATECSE | TOC

Lecture 116: Closure Properties of Context Free Language | Intersection | Complementation | GATECSE | TOC

Lecture 117: Decidable and Undecidable Problem | Undecidability | GATECSE | TOC

Lecture 118: Rice’s Theorem | Undecidability Problem | GATECSE | TOC

Lecture 119: Rice’s Theorem Practice Problems | Undecidability Problem | GATECSE | TOC

Lecture 120: Rice’s Theorem Practice Problems | Undecidability Problem | GATECSE | TOC