Computation Lectures by Ajay Loura

This Channel will provide the lectures related to computing. It includes video lecturers of Theory of Computation (Formal language and Automata Theory) and Quantum Computing.

Quantum Computing: Relation between X-gate, Z-Gate and Hadamard-Gate
Quantum Computing: Relation between X-gate, Z-Gate and Hadamard-Gate
Quantum Computing: Hadamard Gate
Quantum Computing: Hadamard Gate
Quantum Computing: Single Qubit Gate
Quantum Computing: Single Qubit Gate
Quantum Computing: Controlled Not gate
Quantum Computing: Controlled Not gate
Quantum Computing: Classical gates and Its reversibility
Quantum Computing: Classical gates and Its reversibility
Qubit
Qubit
Lecture 49: CFG to GNF Conversion
Lecture 49: CFG to GNF Conversion
Lecture 52: Pumping Lemma for Context-free Language-Part II
Lecture 52: Pumping Lemma for Context-free Language-Part II
Lecture 51: Pumping Lemma for Context-free Languages
Lecture 51: Pumping Lemma for Context-free Languages
Lecture 42:Properties of Context-free Languages
Lecture 42:Properties of Context-free Languages
Lecture 53: Pumping Lemma to Prove that doubly language is not a context-free language.
Lecture 53: Pumping Lemma to Prove that doubly language is not a context-free language.
Lecture 43:Intersection and complement operation in Context-free Languages
Lecture 43:Intersection and complement operation in Context-free Languages
Lecture 48:CYK Algorithm
Lecture 48:CYK Algorithm
Lecture 59:Procedure to identify Type of Grammar
Lecture 59:Procedure to identify Type of Grammar
Lecture 58:Chomsky Hierarchy
Lecture 58:Chomsky Hierarchy
Lecture 47: Greibach Normal form for Odd Palindrome
Lecture 47: Greibach Normal form for Odd Palindrome
Lecture 46:Conversion of CFG to Greibach Normal form (GNF)
Lecture 46:Conversion of CFG to Greibach Normal form (GNF)
Lecture 45:Removal of Left Recursion (Direct and Indirect Recursion)
Lecture 45:Removal of Left Recursion (Direct and Indirect Recursion)
Lecture 44:Left Recursion and Removal of Left Recursion
Lecture 44:Left Recursion and Removal of Left Recursion
DFA and Regular expression design for L={a^nb^m | n+m is even}
DFA and Regular expression design for L={a^nb^m | n+m is even}
Lecture 31:State Elimination Method (DFA to RE Conversion lecture 3)
Lecture 31:State Elimination Method (DFA to RE Conversion lecture 3)
Lecture 30: State Elimination method (DFA to RE Lecture 2)
Lecture 30: State Elimination method (DFA to RE Lecture 2)
Lecture 34: Prove that L=a^2^n is not a regular language using Pumping lemma.
Lecture 34: Prove that L=a^2^n is not a regular language using Pumping lemma.
Lecture 29: State Elimination Method
Lecture 29: State Elimination Method
Tut 3.4 Regular Grammar Design
Tut 3.4 Regular Grammar Design
Tut 4: Regular Grammar
Tut 4: Regular Grammar
Tut 5: Design of Mealy and Moore Machine
Tut 5: Design of Mealy and Moore Machine
Tut 6.2: Prove that Doubly Language is not a regular language by Pumping Lemma.
Tut 6.2: Prove that Doubly Language is not a regular language by Pumping Lemma.
Tut 6.1: Prove that Perfect Cube Language is not Regular language using Pumping Lemma.
Tut 6.1: Prove that Perfect Cube Language is not Regular language using Pumping Lemma.
Lecture 33: Prove that the Perfect Square is not a Regular Language using Pumping Lemma.
Lecture 33: Prove that the Perfect Square is not a Regular Language using Pumping Lemma.