08:21

Construction of Regular Expression Example 1

09:22

Construction of Regular Expression Example 2

09:49

Construction of Language from RE

11:48

Construction of FA from RE part 1

09:18

Construction of FA from RE part 2

09:58

Conversion of FA to RE using Arden’s Theorem Part-1

09:43

Conversion of FA to RE using Arden’s Theorem Part-2

11:44

Conversion of FA to RE using Arden’s Theorem Part-3

12:34

Pumping Lemma

10:23

Chomsky Normal Form (CNF)

07:52

Chomsky Normal Form Part 2(CNF)

13:05

Greibach Normal Form (GNF)

15:17

Construction of PDA using Transition Diagram Part 1

14:05

Construction of PDA using Transition Diagram Part 2

07:02

TM Construction for addition of two unary numbers Part 2

17:41

TM Construction for addition of two unary numbers Part 1

14:53

Equivalane of PDA and CFG Part 1

13:35

Equivalence of PDA and CFG Part 2

07:29

Post Machine Introduction

11:36

Construction of Post Machine

14:21

Closure Properties of CFL's

15:12

Post machine accepting Non CFL's

11:51

Turing Machine Introduction and Formal Definition

19:32

TM Construction for 2's compliment Part 1

08:43

TM Construction for 2's compliment Part 2

23:40

TM Construction for well formedness of Parenthesis Part 1

07:13

TM Construction for well formedness of Parenthesis Part 2

09:00

TM Construction for multiplication of two unary numbers Part 1

16:04

TM Construction for multiplication of two unary numbers Part 2

17:39

Recursive and Recursively enumerable languages

06:36

Closure Properties of RE and REC

09:48

Variants of Turing Machines: Universal TM

06:44

Multitape TM

08:20

Nondeterministic TM

09:40

Comparision of FA, PDA, PM and TM

15:45

Halting Problem of TM

08:35

Decidability CFG

09:33

Decidability DFA

07:31

Decidability NFA

07:47

Decidability Regular Expression

06:19

Decidability Equal DFA

07:54

Undecidability Equal CFG

13:51

Chomsky Hierarchy

08:49

Application of Pumping Lemma Part 1

08:29

Application of Pumping Lemma Part 2

09:59

Applications of Regular Expression

14:11

Closure Properties of Regular Languages

11:56

Basic Properties of Regular Expression

08:51

Grammar Introduction

10:00

Formal Definition of Grammar

12:40

Grammar Notations

15:36

Derivation Process Part 1

11:32

Derivation Process Part 2

15:10

Context free Languages CFLs Part 1

07:22

Context Free Languages CFLs Part 2

14:53

Ambiguous Context free grammar

11:01

Removal of Ambiguity

16:36

Simplification of CFG Removal of useless symbols

12:40

Simplification of CFG Removal of unit production

14:43

Simplification of CFG Removal of e production