18:30

Theory of Computation: CNF_Another Example

15:00

Compiler Design: RE to DFA by Direct Method_Another Example

28:20

Compiler Design: RE to DFA by Direct Method

28:39

Theory of Computation: RE to DFA

23:31

Theory of Computation: Turing Machine to MPCP Conversion

04:46

Theory of Computation: MPCP to PCP Conversion

02:23

Theory of Computation: Modified Post Correspondence Problem (MPCP)

09:49

Theory of Computation: Post’s Correspondence Problem (PCP)

08:04

Theory of Computation: Code for Turing Machine

03:42

Theory of Computation: Undecidability - Introduction

11:58

Theory of Computation: Turing Machine Problem - Substring

22:58

Theory of Computation: Turing Machine Problem - Palindrome

09:28

Theory of Computation: Turing Machine Problem - Concatenation

23:47

Theory of Computation: Turing Machine Introduction

05:42

Theory of Computation: Pumping Lemma for CFL - Example3 (0^2^i)

04:04

Theory of Computation: Pumping Lemma for CFL - Example2 (a^k b^j c^k d^j)

09:35

Theory of Computation: Pumping Lemma for CFL with Example (a^n b^n c^n)

22:36

Theory of Computation: Conversion of PDA to CFG

18:21

Theory of Computation: Conversion of CFG to PDA

06:36

Theory of Computation: DPDA Example (wcw^r)

22:16

Theory of Computation: NPDA Example (w w^r)

08:42

Theory of Computation: PDA Example (a^n b^m c^m d^n)

05:46

Theory of Computation: PDA Example (a^n b^m c^n)

07:52

Theory of Computation: PDA Example (a^n b^2n)

26:55

Theory of Computation: PDA Introduction with Example (0^n 1^n)

08:09

Theory of Computation: GNF Example

18:43

Theory of Computation: Greibach Normal Form (GNF) with example

04:27

Theory of Computation: Ambiguous Grammar - Example

07:50

Theory of Computation: Derivations and Parse Tree - Example

08:47

Theory of Computation: Types of Grammar

21:18

Theory of Computation: Construction of CFG - Examples

20:45

Theory of Computation: CFG Introduction (Derivation, Parse Tree, Ambiguity)

08:08

Theory of Computation: Conversion of DFA to RE- State Elimination Method- Example3

09:53

Theory of Computation: Conversion of DFA to RE- State Elimination Method- Example2

13:07

Theory of Computation: Conversion of DFA to RE - State Elimination Method: Example1

11:50

Theory of Computation: Conversion of DFA to RE - State Elimination Method

23:04

Theory of Computation: Conversion of DFA to RE (Rijk method)-Example2

18:00

Theory of Computation: Conversion of DFA to RE (Rijk method)-Example1

15:04

Theory of Computation: Conversion of DFA to RE (Rijk Method)

06:23

Theory of Computation: Pumping Lemma- Example3

05:29

Theory of Computation: Pumping Lemma-Example2

12:33

Theory of Computation: Pumping Lemma for Regular Languages

16:48

Theory of Computation: Conversion of RE to Epsilon-NFA

16:20

Theory of Computation: Minimized DFA

11:41

Theory of Computation: Conversion of Epsilon-NFA to NFA

12:53

Theory of Computation: Conversion of Epsilon-NFA to DFA

09:09

Theory of Computation: NFA to DFA conversion Example

12:23

Theory of Computation: NFA to DFA conversion (Subset Construction Method)

15:40

Theory of Computation: Extended Transition Function for NFA with an Example

14:41

Theory of Computation: Extended Transition Function for DFA with an Example

08:51

Theory of Computation: Inductive Proof Example

08:32

Theory of Computation: Inductive Proof

08:23

Theory of Computation: Deductive Proof

12:22

Theory of Computation: Basic Definitions in Automata Theory

08:17

Theory of Computation: Epsilon Closure

08:02

Theory of Computation: Example for DFA (Even 0's and even 1's)

07:28

Theory of Computation: Example for DFA (Divisible by 3)

06:00

Theory of Computation: Example for DFA (binary number is even)

06:07

Theory of Computation: Example for DFA (Not substring)

09:44

Theory of Computation: Example for NFA and DFA (Substring problem)