16:12

Admission Process-IISc Bangalore-2021

06:41

Lec 174 a^2n b^n

03:55

Lec 173 number of a's = number of b's

22:11

Lec 172 ww^r | w belongs to (a,b)* | Even Palindrome

10:26

Lec 171 w#w^r | w belongs to (a,b)*

07:14

Lec 170 a^nb^2n | n is greater than 0

09:32

Lec 169 DPDA a^m b^n c^m+n

07:58

Lec.168 DPDA a^m+n b^m c^n

09:33

Lec 167 DPDA

03:53

IIIT Delhi M.tech Winter Admission Starts

02:55

TOC Test -04 CFG, CNF Grammar

12:07

Lec 166 Why and When to change the state in PDA??

38:15

Lec.165 Why Final State Method-DPDA is more Powerful than Empty Stack Method-DPDA || PREFIX Property

07:50

Lec 164 What is Prefix Property

19:09

Lec 163 Empty Stack Method || Final state Method

12:07

Lec 162 Introduction to PushDown Automata

23:00

Lec 161 Important Formula for CFG and CNF

12:54

Lec. 160 CYK Algorithm Example

21:59

Lec159 CYK Algorithm || Membership Problem of CFL || Decidable problem

06:49

Lec.158 Finiteness Problem of CFL || Decidable Problem

05:31

Lec. 157 Emptiness problem of CFG || Decision Problem

10:15

Lec 156 Greibach Normal Form || GNF || Normalization of CFG

27:29

Lec 155 Chomsky Normal Form || CNF || Normalization of CFG

16:49

Lec 154 Elimination of epsilon production

09:24

Lec 153 Elimination of Unit Production

22:01

Lec 152 Useless Variable || Simplification of Gramamar

18:29

Lec 151 Inherently Ambiguous Grammar || Inherently Ambiguous Language

24:47

Lec 150 Ambiguous Grammar || LMD || RMD || is Regular Grammar ambiguous??

37:13

Lec 149 Example of Context Free Grammar

24:06

Lec 148 Why is CFG called Context Free??

09:35

Lec 147 Application and Limitation of FA

17:04

Lec 146 Mealy to Moore Conversion , Moore to Mealy Conversion

18:47

Lec 145 Moore Machine || FA as Transducer or output generator

27:37

Lec 144 Mealy Machine || FA as Transducer or Output Generator

16:02

Lec 143 All Variation of ww || regular or not || par -02t

18:01

Lec. 142 All Variation of ww || Regular or not || part -01

01:32

TOC Test -03

18:58

Lec 142 All variation of ww^r Language || Regular or not || Part 04

19:30

Lec 141 All variation of ww^r Language || Regular or not || Part 6

17:44

Lec 140 All variation of ww^r Language || Regular or Non-Regular || part 2

22:00

Lec 139 All Variation of ww^r Language || Regular or Non-Regular

02:13

Toc -Test 02 Finite Automata

08:46

Lec 138 is L is regular ?? Part-03

11:04

Lec 137 is Language L is Regular?? Part-02

22:13

Lec 136 How to find L is Regular or not || Part 01

22:54

Lec 135 How to find Minimum Pumping Length for Regular Language

29:48

Lec 134 Pumping Lemma of regular language part 02

19:28

Lec 133 Pumping Lemma || Pigeonhole Principle

16:34

TOC Test-01 Solution

30:53

Lec 132 Arden's theorem || Proof and Application.

02:18

TOC TEST -01 Finite Automata

09:27

Lec 131 Types of Grammar || Type-0,Type-1,Type-2,Type-3,S-Grammar

20:26

Lec 130 Convert Left linear Grammar to Right Linear Grammar

07:16

Lec 129 Regular Grammar to Finite Automata

13:36

Lec 128 Construct Finite Automata to Regular Grammar

07:04

Lec 127 Regular Grammar for Length machine

04:04

Lec 126 Regular Grammar L=First 2 symbol are same, L=Last 2 symbol are same

06:12

Lec 125 Regular grammar for 'Start and End with same symbol'

12:29

Lec 124 Regular Grammar forL= {Start with 'a' and End with 'b' },L={Start with 'a' and Or with 'b' }

07:58

Lec 123 Regular grammar for L=start with 'a' , L=End with 'b'