Author thumbnail

Education 4u

Theory of Computation ( TOC )

6,516,283 views
96 items
Last updated on Dec 4, 2020
public playlist
TOC introduction | TOC | Lec-1 | Bhanu Priya
8:30
symbol, alphabet, string | basic definations | TOC  | Lec-2 | Bhanu Priya
7:55
sempty, lenght, concatenation of string | TOC | Lec-3 | Bhanu Priya
5:13
power of alphabet | TOC | Lec-4 | Bhanu Priya
10:11
languages & operations | TOC  | Lec-5 | Bhanu Priya
11:44
finite automata | TOC  | Lec-6 | Bhanu Priya
4:26
transition diagrams, table and function | finite automata | TOC  | Lec-7 | Bhanu Priya
7:01
finite automata | applications & different type | TOC  | Lec-8 | Bhanu Priya
3:47
deterministic finite automata (DFA) | TOC  | Lec-9 | Bhanu Priya
10:30
dfa example with solution | Part-1 | TOC  | Lec-10 | Bhanu Priya
9:52
dfa example with solution | Part-2 | TOC  | Lec-11 | Bhanu Priya
5:46
dfa example with solution | Part-3 | TOC  | Lec-12 | Bhanu Priya
4:44
non deterministic finite automata (NFA) | TOC  | Lec-13 | Bhanu Priya
8:41
NFA example | Part-1 | TOC  | Lec-14 | Bhanu Priya
7:26
NFA example | Part-2 | TOC  | Lec-15 | Bhanu Priya
6:28
NFA example | Part-3 | TOC  | Lec-16 | Bhanu Priya
9:10
nfa with epsilon  | TOC  | Lec-17 | Bhanu Priya
5:14
nfa and dfa differences | TOC  | Lec-18 | Bhanu Priya
5:35
conversion of nfa to dfa examples | Part-1 | TOC  | Lec-19 | Bhanu Priya
8:23
conversion of NFA to DFA example | Part-2 | TOC  | Lec-20 | Bhanu Priya
9:57
equivalence of two finite automata | TOC  | Lec-21 | Bhanu Priya
11:05
equivalence of two FA example | TOC  | Lec-22 | Bhanu Priya
6:13
minimization of DFA | TOC  | Lec-23| Bhanu Priya
6:33
minimization of DFA example | TOC  | Lec-24| Bhanu Priya
10:18
Mealy machine | TOC  | Lec-25| Bhanu Priya
10:03
mealy machine design | Example1 | TOC  | Lec-26| Bhanu Priya
4:50
mealy machine design | Example2 | TOC  | Lec-27| Bhanu Priya
8:23
mealy machine design | Example3  | TOC  | Lec-28| Bhanu Priya
7:29
moore machine | TOC  | Lec-29| Bhanu Priya
4:30
moore machine design | Example1 | TOC  | Lec-30| Bhanu Priya
8:03
moore machine design | Example2 | TOC | Lec-31| Bhanu Priya
7:18
moore machine design | Example3 | TOC | Lec-32| Bhanu Priya
5:13
mealy and moore machine | differences | TOC | Lec-33| Bhanu Priya
4:02
mealy to moore conversion | TOC | Lec-34| Bhanu Priya
5:07
mealy to moore example | TOC | Lec-35 | Bhanu Priya
11:12
mealy to moore example 2 | TOC | Lec-36 | Bhanu Priya
7:33
moore to mealy machine conversion | Example-1 | TOC | Lec-37 | Bhanu Priya
6:58
moore to mealy machine conversion | Example-2 |  TOC | Lec-38 | Bhanu Priya
6:27
moore to mealy machine conversion | Example-3 | TOC | Lec-39 | Bhanu Priya
7:05
regular expressions in theory of automata  | TOC | Lec-40 | Bhanu Priya
5:19
regular expression | Examples | TOC | Lec-41 | Bhanu Priya
6:04
convert regular expression to finite automata | TOC | Lec-42 | Bhanu Priya
7:02
convert regular expression to finite automata | examples | TOC | Lec-43 | Bhanu Priya
7:43
closure properties of regular languages | Part-1| TOC | Lec-44 | Bhanu Priya
6:17
closure properties of regular languages | Part-2 | TOC | Lec-45 | Bhanu Priya
7:45
pumping lemma for RL | TOC | Lec-46 | Bhanu Priya
7:48
pumping lemma for RL example | TOC | Lec-47 | Bhanu Priya
7:01
context free grammer | Introduction | TOC | Lec-48 | Bhanu Priya
8:07
context free grammar in automata |Example-1 | TOC | Lec-49 | Bhanu Priya
5:24
context free grammar in automata | Example-2 | TOC | Lec-50 | Bhanu Priya
5:35
context free grammar in automata | Example-3 | TOC | Lec-51 | Bhanu Priya
4:31
derivation in theory of computation | TOC | Lec-52 | Bhanu Priya
8:40
leftmost and rightmost derivations | Example-1 | TOC | Lec-53 | Bhanu Priya
5:48
leftmost and rightmost derivations | Example-2 | TOC | Lec-54 | Bhanu Priya
6:49
leftmost and rightmost derivations | Example-3 | TOC | Lec-55 | Bhanu Priya
7:57
derivation tree | TOC | Lec-56 | Bhanu Priya
5:09
derivation tree example 1 | TOC | Lec-57 | Bhanu Priya
10:22
derivation tree Example 2 | TOC | Lec-58 | Bhanu Priya
5:39
ambiguity in grammar | TOC | Lec-59 | Bhanu Priya
8:12
ambiguity in grammar example 1 | TOC | Lec-60 | Bhanu Priya
6:10
ambiguity in grammar example 2  | TOC | Lec-61 | Bhanu Priya
5:50
unambiguous grammar  | TOC | Lec-62 | Bhanu Priya
5:04
unambiguous grammar example 1 | TOC | Lec-63 | Bhanu Priya
5:25
unambiguous grammar example 2 | TOC | Lec-64 | Bhanu Priya
7:47
simplification of CFG  | TOC | Lec-65 | Bhanu Priya
5:24
removal of useless symbols | CFG | TOC | Lec-66 | Bhanu Priya
6:53
elimination of epsilon production  | TOC | Lec-67 | Bhanu Priya
6:03
removal of unit production | CFG  | TOC | Lec-68 | Bhanu Priya
4:06
Chomsky normal form  | TOC | Lec-69 | Bhanu Priya
6:59
converting CFG to CNF | steps | TOC | Lec-70 | Bhanu Priya
6:50
converting CFG to CNF example | TOC | Lec-71 | Bhanu Priya
13:13
griebach normal form  | TOC | Lec-72 | Bhanu Priya
6:22
converting CFG to GNF example-1 | TOC | Lec-73 | Bhanu Priya
14:32
converting CFG to GNF example - 2 | TOC | Lec-74 | Bhanu Priya
17:27
pumping lemmafor CFL | TOC | Lec-75 | Bhanu Priya
8:53
pumping lemma example | Part-1 | TOC | Lec-76 | Bhanu Priya
7:27
pumping lemma example | Part-2 | TOC | Lec-77| Bhanu Priya
7:10
pushdown automata (PDA) in TOC | Introduction | Part-1/2| Lec-78| Bhanu Priya
5:54
pushdown automata (PDA) in TOC | Introduction | Part-2/2| Lec-79| Bhanu Priya
6:23
pushdown automata (PDA) | terminologies used | TOC | Lec-80| Bhanu Priya
6:57
pushdown automata (PDA) acceptance  | TOC | Lec-81 | Bhanu Priya
5:29
pushdown automata example | Part-1/2  | TOC | Lec-82 | Bhanu Priya
10:00
pushdown automata example | Part-2/2 | TOC | Lec-83 | Bhanu Priya
6:35
cfg to pda conversion | conversion  | TOC | Lec-84 | Bhanu Priya
12:29
Turing machine ( TM)  | Introduction | Part-1/2 | TOC | Lec-85 | Bhanu Priya
6:43
Turing machine (TM)  | Introduction | Part-2/2  | TOC | Lec-86 | Bhanu Priya
5:30
Turing machine (TM) | operation on tape | TOC | Lec-87| Bhanu Priya
4:35
turing thesis | turing machine | TOC | Lec-88 | Bhanu Priya
3:51
Turing machine(TM) language  | TOC | Lec-89 | Bhanu Priya
6:58
turing machine | Example-1 | TOC | Lec-90 | Bhanu Priya
5:58
turing machine | Example-2 | TOC | Lec-91| Bhanu Priya
6:21
variants of TM | Multitape & Non deterministic | Part-1/2  | TOC | Lec-92 | Bhanu Priya
6:33
variants of TM | Multihead & Offline  | Part-2/2 | TOC | Lec-93 | Bhanu Priya
6:33
Recursive & Recursively enumerable languages | TOC | Lec-94 | Bhanu Priya
3:33
halting problem | Turing Machine(TM) | TOC | Lec-95 | Bhanu Priya
4:53
complexity classes | P & NP | TOC | Lec-96 | Bhanu Priya
9:07