01:58:10

Turing Machine model, Turing machine design

03:37

Transition graph for Turing Machine Theory of Computation

17:48

Turing Machine 1 Theory of Computation

06:58

SAT problem 4

03:24

SAT problem 3

01:25

SAT problem 2

05:04

SAT problem

10:54

problems P NP 1

17:44

p np 2

09:06

Acceptance of CFG by empty stack and final state

09:45

PDA to CFG eg 3

04:16

Rules to convert PDA to CFG

12:08

PDA to CFG : eg 2

18:24

PDA to CFG : eg. 1

13:59

NPDA using CFG in CNF

24:43

PDA DPDA NPDA

07:30

Regular expression(RE) to Context free Grammar(CFG) eg 1: Theory of Computation

02:34

Regular expression(RE) to Context free Grammar(CFG) eg 2: Theory of Computation

07:34

Regular expression(RE) to Context free Grammar(CFG) eg 3: Theory of Computation

15:48

Derivation tree for deriving strings from Grammar : Theory of Computation

14:43

Context free Language to Context free Grammar (CFL to CFG): Theory of Computation

14:17

Context free Grammar to Context free Language (CFG to CFL): Theory of Computation

22:54

Pumping Lemma concept_1:Theory of Computation

22:15

Pumping Lemma to prove non regularity of language -eg 1: Theory of Computation

04:53

Procedure to prove non regularity using pumping lemma : Theory of Computation

12:07

Pumping Lemma for proving non-regularity of Language - eg 3: Theory of Computation

07:42

Pumping Lemma for proving non-regularity of Language - eg 2: Theory of Computation

10:15

Derivation of string from Grammar using leftmost and rightmost derivation : Theory of Computation

11:27

Regular expression (RE) application : Theory of Computation

26:50

Regular Expression (RE) Closure and Decision properties : Theory of Computation

23:30

Language description to RE : Theory of Computation

18:57

RE to DFA through NFA with epsilon transition including minimization : Theory of Computation

10:52

RE to NFA with epsilon move eg 2: Theory of Computation

16:45

RE to NFA with epsilon move: Theory of Computation

06:38

RE equivalence proof:Theory of Computation

07:07

Regular expression identity rules : Theory of Computation

38:04

19:Moore and Mealy machine inter-conversion : Theory of Computation

13:54

8:Designing Finite Automata : Theory of Computation

10:14

20:Case study of Finite Automata : Theory of Computation

30:41

21.Regular Expression 1 : Theory of Computation

19:23

17:Design of Moore machine : Theory of computation

16:18

18:Design of Mealy machine : Theory of computation

10:39

16:Moore and Mealy machine :Theory of Computation

16:14

13:DFA minimization in NFA to DFA conversion-Part-II : Theory of Computation

15:19

15:NFA with Epsilon transition to DFA (Direct Method) :Theory of computation

20:06

14:NFA with epsilon transition to DFA (Indirect method) :Theory of computation

27:09

12.DFA minimization in NFA to DFA conversion-Part-I : Theory of Computation

10:59

10:NFA to DFA method II (Direct Method) example 1: Theory of Computation

24:44

11:NFA to DFA method II(Direct Method) example 2: Theory of Computaion

30:36

7:Designing of Finite Automata 1 :Theory of computation

39:55

2 :Finite Automata (FA) representation, DFA , NFA and FA as language acceptor :Theory of Computation

35:42

9:NFA to DFA conversion method 1: Theory of Computation

09:29

6. Power and Equivalence of NFA and DFA : Theory of computation

09:57

4:FA as finite control :Theory of Computation

06:56

5: NFA representation : Theory of Computation

36:24

3:FA as sequence detector :Theory of Computation

33:32

1: FSM for Binary adder :Theory of Computation