03:17

Quantum Computing: Relation between X-gate, Z-Gate and Hadamard-Gate

07:47

Quantum Computing: Hadamard Gate

10:48

Quantum Computing: Single Qubit Gate

05:26

Quantum Computing: Controlled Not gate

09:08

Quantum Computing: Classical gates and Its reversibility

06:46

Qubit

10:32

Lecture 49: CFG to GNF Conversion

10:55

Lecture 52: Pumping Lemma for Context-free Language-Part II

06:02

Lecture 51: Pumping Lemma for Context-free Languages

06:23

Lecture 42:Properties of Context-free Languages

04:20

Lecture 53: Pumping Lemma to Prove that doubly language is not a context-free language.

03:52

Lecture 43:Intersection and complement operation in Context-free Languages

08:18

Lecture 48:CYK Algorithm

06:07

Lecture 59:Procedure to identify Type of Grammar

10:04

Lecture 58:Chomsky Hierarchy

08:57

Lecture 47: Greibach Normal form for Odd Palindrome

10:14

Lecture 46:Conversion of CFG to Greibach Normal form (GNF)

05:31

Lecture 45:Removal of Left Recursion (Direct and Indirect Recursion)

05:52

Lecture 44:Left Recursion and Removal of Left Recursion

09:40

DFA and Regular expression design for L={a^nb^m | n+m is even}

06:40

Lecture 31:State Elimination Method (DFA to RE Conversion lecture 3)

09:02

Lecture 30: State Elimination method (DFA to RE Lecture 2)

04:05

Lecture 34: Prove that L=a^2^n is not a regular language using Pumping lemma.

08:38

Lecture 29: State Elimination Method

08:51

Tut 3.4 Regular Grammar Design

09:04

Tut 4: Regular Grammar

13:55

Tut 5: Design of Mealy and Moore Machine

03:58

Tut 6.2: Prove that Doubly Language is not a regular language by Pumping Lemma.

04:14

Tut 6.1: Prove that Perfect Cube Language is not Regular language using Pumping Lemma.

04:53

Lecture 33: Prove that the Perfect Square is not a Regular Language using Pumping Lemma.

06:34

Lecture 32:DFA to RE Conversion using Arden's Theorem

05:30

Lecture 28: Moore to Mealy machine

06:46

Lecture 27: Mealy to Moore Conversion

06:53

Lecture 26: Moore Machine

07:26

Lecture 25: Mealy Machine

05:44

Tutorial 3.1: Design of DFA that involves not operation

08:16

Tutorial 3.3: Finding minimum length string not presented in a regular expression

04:40

Tutorial 3.2: DFA design start or end with a double letter

08:48

Tutorial 2.3: DFA Design for nth symbol from the right end is 1.

08:04

Tutorial 2.2: Design of DFA

08:00

Lecture 19:Properties of Null language and Null string

10:50

Lecture 5: Java Regex

11:42

Lecture 7.2: DFA and Regular expression design for Even number of a's and Even number of b's.

08:15

Lecture 10: Design of DFA over {0,1} whose decimal equivalent is divisible by a particular number

06:47

Tutorial 2.1: Regular Expression

17:04

Lecture 18: Right Linear Grammar to Left Linear Grammar

24:53

Lecture 39:Context-free grammar to Chomsky Normal form

12:51

Lecture 38:Ambiguity in Context-free Grammar

07:59

Lecture 32: Design of Type 0 Grammar

18:52

Lecture 56: Turing Machine for Palindrome

19:12

Lecture 55: Turing Machine For Multiplication a^ib^jc^k such that k=i*j

14:24

Lecture 54: Turing Machine

17:59

Lecture 40: Pushdown Automata

17:58

Lecture 21: Intersection operation on Regular Languages.

20:55

Lecture 20: Properties of Regular languages

12:14

Lecture 17: Left to Right Linear Grammar

15:51

Lecture 41:Non-deterministic Pushdown Automata

13:10

Lecture 16:Right Linear Grammar to Finite Automata

11:17

lecture 35: Design of Context-free Grammar

14:43

Lecture 36:Design of Context-free Grammar