09:51

Design a DFA || sub string as "bab"

12:36

DFA for || String start with aba

09:40

DFA for || String End with 100

08:28

DFA for String start with 01 and end with 10

18:37

Closure and Decision Property of CFL || CFG

09:36

Chomsky classification of Grammar || Chomsky Hierarchy || Grammar Classification ||

27:24

CYK algorithm || Membership algorithm ||

15:35

PDA to CFG || Part - 3|| Example 2

20:42

PDA to CFG || Part - 2 || Example - 1

06:25

PDA to CFG || Part -1|| Push Down Automata to Context Free Grammar

09:03

Inherent Ambiguity || Dangling Else Problem ||

09:57

Pumping lemma for CFG || Context Free Grammar

10:17

Pumping Lemma For Regular Language

13:29

CFG to PDA || Grammar to Push Down Automata

29:48

Grammar (TOC) || Revision Part ||

07:24

PDA for a^m b^n c^n || Push Down Automata

17:37

Simplification of Context Free Grammar

14:51

CFG to CNF Conversion || Chomsky Normal Form

18:52

Ambiguous grammar and it's conversion to Unambiguous

10:34

CFG to GNF conversion || Greibach Normal Form

29:53

Grammar in TOC || Part -2 || basic details || Revision

29:47

Grammar || Part -1 || Derivation Tree || Ambiguous Grammar|| Language Generations ||

13:07

PDA for || WW || WW^R ||

06:14

Design a PDA for Equal no of a = Equal no of b , at time 2:53 min it's b, b/bb in place of b, b/bz0

05:02

PDA for L= a^n b^n where n is greater or equal to 0 ( see description)

07:58

PDA For WCW

11:08

PDA for WCW^R

09:03

a^n b^n+m c^m || Push Down Automata|| where n, m is greater then 0

08:24

a^n b^n c^m || Push Down Automata || where n, m is greater then 0

09:44

a^n b^(2n+1) || Push Down Automata|| where n is greater then 0

09:27

a^n b^m c^n+m || Push Down Automata|| where n, m is greater then 0

07:47

a^n b^m c^n || PDA || where n, m is greater then 0

08:37

a^(n+m) b^n c^m || Push Down Automata|| where n, m is greater then 0

11:47

Two Stack PDA || L={a^n b^n c^n d^n} || where n is greater then 0 || Part - 3 ||

16:00

Two Stack PDA || Part - 2|| a^n b^n a^n b^n || where n is greater then 0

17:29

Two Stack PDA|| Part - 1|| Push Down Automata || L=(a^n b^n c^n) || See the description

12:39

Design a PDA || L={ a^n b^n c^m d^m} || where n, m is greater then 0

10:39

Design a PDA || L= { a^n b^2n | where n is greater then 0}

10:27

Design a PDA || L={a^n b^n c^n} || where n is greater then 0

11:59

Design a PDA || L={ a^n b^n | where n is greater than 0}||

27:23

Push Down Automata || PDA Introduction || ID of PDA|| PUSH || POP || SKIP || Operation in PDA

15:42

Universal Turing Machine || UTM

10:18

Church Thesis || Church-Turing Thesis || Turing Thesis ||

08:45

Decidability and Undecidability || Decidable and Undecidable || Problem

31:34

Variants of Turing Machine || Type of Turing machine

08:32

Turing Machine || a^i b^j c^k || i j k is greater then 0

10:17

Turing Machine || a^i b^i c^k || i less then j and j is less then k and i j k is greater then 0

12:53

Turing Machine || (a^i b^j c^k)^n || i j k is greater then 0 and n is greater then 2

12:25

Turing Machine || a^i b^j c^k || i greater then j and j greater then k || i j k is greater then 0

12:08

Turing Machine||a^i b^j c^k || k=i*j ||at time 10:28, at q6 , b, Y, R Instead of Y, b, R

10:07

Turing Machine || L= a^i b^j where i and j is greater than 0

24:05

Turing Machine || L= WW || W€(a,b)* || ( Note: in video q0 to q4 Transition is X,X,L and Y,Y,L)

14:57

Turing Machine || L= WCW^R || w€ (a, b)*

07:38

Turing Machine || Equal No of a's and Equal No of b's

12:54

Turing Machine || L= WW^R || w € (a, b)*

12:03

Turing machine || L=a^n b^m c^n d^m || n, m is greater then 0

12:04

Turing Machine || L=a^n b^m c^n+m || n, m is greater then 0

08:20

Turing machine || L=a^n b^m || where n and m is greater then 0

13:45

Turing Machine || L=1^3^n ||

11:46

Truring Machine || L= 1^2^n