Warshall’s Algorithm – transitive closure
sp computer science
Warshall’s Algorithm – transitive closure
10:34
Prim’s algorithm
sp computer science
Prim’s algorithm
8:49
Mathematical analysis of recursive algorithms smoothness algorithm
sp computer science
Mathematical analysis of recursive algorithms smoothness algorithm
6:00
Master’s theorem
sp computer science
Master’s theorem
4:18
Analysis of non-recursive algorithms
sp computer science
Analysis of non-recursive algorithms
15:58
Post Correspondence Problem(PCP)
sp computer science
Post Correspondence Problem(PCP)
5:16
Universal Language(Lu)
sp computer science
Universal Language(Lu)
8:34
Ld(Diagonal Language)
sp computer science
Ld(Diagonal Language)
5:27
Turing Machine Encoding
sp computer science
Turing Machine Encoding
10:55
Decidable and undecidable languages
sp computer science
Decidable and undecidable languages
7:55
Turing Machine language
sp computer science
Turing Machine language
11:54
Turing Machine types
sp computer science
Turing Machine types
3:36
Turing Machine Construction- add&sub
sp computer science
Turing Machine Construction- add&sub
14:05
Turing Machine Example Cntd
sp computer science
Turing Machine Example Cntd
3:06
Turing Machine Example
sp computer science
Turing Machine Example
15:02
Turing Machine-Multipletrack
sp computer science
Turing Machine-Multipletrack
13:10
Turing Machine-Storage in finite control
sp computer science
Turing Machine-Storage in finite control
8:14
DPDA example
sp computer science
DPDA example
8:21
DPDA and Closure properties
sp computer science
DPDA and Closure properties
10:59
Eliminating useless symbols from CFG
sp computer science
Eliminating useless symbols from CFG
11:44
Eliminating unit production from CFG
sp computer science
Eliminating unit production from CFG
5:44
Eliminating nullable symbols from CFG
sp computer science
Eliminating nullable symbols from CFG
9:07
Chomsky Normal Form
sp computer science
Chomsky Normal Form
9:35
Conversion of PDA to CFG
sp computer science
Conversion of PDA to CFG
14:11
Conversion of CFG to PDA
sp computer science
Conversion of CFG to PDA
7:52
Derivation using grammar
sp computer science
Derivation using grammar
7:23
Context Free Grammar(CFG)
sp computer science
Context Free Grammar(CFG)
9:13
Properties of RL
sp computer science
Properties of RL
10:21
Minimization of Automaton
sp computer science
Minimization of Automaton
14:17
Regular Expression
sp computer science
Regular Expression
9:45
DFA Construction3
sp computer science
DFA Construction3
2:30
DFA Construction2
sp computer science
DFA Construction2
3:47
Epsilon NFA to NFA
sp computer science
Epsilon NFA to NFA
4:55
Epsilon NFA to DFA
sp computer science
Epsilon NFA to DFA
5:23
Epsilon NFA
sp computer science
Epsilon NFA
6:22
NFA to DFA
sp computer science
NFA to DFA
7:26
DFA Construction1
sp computer science
DFA Construction1
7:19
Non-deterministic Finite Automata(NFA)
sp computer science
Non-deterministic Finite Automata(NFA)
10:33
Deterministic Finite Automata (DFA)
sp computer science
Deterministic Finite Automata (DFA)
15:05
Finite Automata
sp computer science
Finite Automata
6:32