Theory of Computation (TOC)
Video Lectures

6:141 Why study Theory Of Computation | TOC | Lec-0 6:022 What is Finite Automata in TOC | Finite state machine (FSM) in TOC | Lec-1 5:543 Deterministic Finite Automata in hindi l DFA l TOC | lec-2 5:314 Non deterministic finite automata in hindi l NDFA I TOC | lec-3 2:415 NFA example having 3 consecutive 0's in TOC | TOC | Lec-4 2:266 DFA example l Having 3 consecutive 0's l TOC (lec-5) 7:237 NFA to DFA conversion Example step by step l TOC | lec-6 3:158 NFA to DFA conversion example 2 l TOC | lec-7 5:409 NFA with null moves to DFA conversion l TOC | lec-8 5:3010 NFA with null moves to DFA example 2 l TOC | lec-9 5:4311 Equivalence of Two finite automata with Example I TOC | lec-10 3:1012 Equivalence of Two finite automata example 2 l TOC | lec-11 7:3213 Minimization of DFA in theory of computation I TOC | lec-12 5:4614 Minimization of DFA example 2 l TOC | lec-13 6:4315 Finite Automata with Output l Moore, Mealy machine l TOC | Lec-14 4:5916 Moore to Mealy conversion with Example l TOC | lec-15 5:4917 Mealy to Moore Conversion with example l TOC | lec-16 5:4918 Definition of Grammar and Language in theory of computation l TOC | lec-18 2:5919 Language generated by Grammar in theory of computation l TOC | lec-19 2:5320 Language generated by Grammar Example 2 l TOC | lec-20 4:4221 Grammar generated by Language in theory of computation l TOC | lec-21 4:5422 Regular Language and Regular Expression with example in theory of computation l TOC | lec-21 5:3923 Examples of regular expressions in theory of computation l TOC | lec-22 5:2124 Regular expression examples 3 | TOC | lec-23 6:1725 Regular expression example part 4 | TOC | lec-24 5:5026 DFA accept strings examples | Accept doublet, start with 0 | TOC | lec-24 2:2027 dfa that accepts word length is divisible by any number | word length is even | TOC | lec-26 2:3928 DFA for word start and end with different Character | TOC | lec-27 2:4829 DFA divisible by 2 | TOC | lec-28 1:5330 DFA of all binary number divisible by 3 | TOC | lec-29 3:3331 DFA divisible by 5 Short trick | TOC | lec-30 2:1632 DFA for even numbers of 0's and even numbers of 1's | TOC | lec-31 5:4533 Elimination of null moves from NDFA in TOC | Lec-32 3:2634 Regular grammar for a given DFA in TOC | lec-33 3:3135 DFA for given regular expression in TOC | lec-34 4:0336 Conversion of regular expressions to NDFA in hindi | TOC | lec-35 2:4737 Regular expression to NDFA examples in hindi part 2 | TOC | lec-36

2:5138 Regular expression to NDFA part 3 | TOC | lec-37 6:1439 Regular expression to DFA with example in hindi | TOC | lec-38 3:2740 Regular expression to DFA example part 2 in hindi | TOC | lec-39 4:3041 DFA to regular expression with example in hindi | arden's theorem | TOC | lec-40 3:4942 DFA to regular expression example part 2 | Finite automata to regular expression | TOC | lec-41 4:5043 Equivalence of regular expressions with example in hindi | TOC | lec-42 3:5944 Context free grammar in theory of computation in hindi | LMD and RMD | TOC | lec-43 3:0745 Context Free Language and Ambiguity in theory of computation | TOC | lec-44 2:5846 Elimination of Ambiguity in CFG | Simplification of CFG | TOC | lec-45 3:4847 Elimination of left recursion in CFG | TOC | lec-46 2:5448 Elimination of left factoring in CFG | TOC | lec-47 2:4649 Elimination of useless symbol in CFG | TOC | lec-48 3:0550 Elimination of null production in CFG | TOC | lec-49 2:4951 Elimination of unit production in CFG | TOC | lec-50 5:2852 Chomsky normal form examples in theory of computation | Normal form for CFG | TOC | lec-51 3:5953 Chomsky normal form with examples in toc (part 2) | CNF | TOC | lec-52 3:4754 Griebach normal form with examples step by step | GNF | TOC | lec-53 5:1555 GNF with example in theory of computation in hindi part-2 | TOC | lec -54 3:3656 Pumping leema for regular set in theory of computation in hindi | TOC | lec-55 4:2357 Pumping leema examples for regular set in theory of computation | TOC | lec -56 3:4058 Pumping leema for context free grammar with example | TOC | lec-57 4:5959 Pushdown Automata with example in theory of computation | TOC | lec-58 4:2360 PDA examples part 2 | Pushdown automata in theory of computation | TOC | lec-59 4:0461 PDA for even and odd length palindrome example in hindi | TOC | lec-60 8:1662 Turing Machine with Example in hindi in theory of computation | TOC | lec-61 4:5963 Construct Turing Machine for language Example | TOC | lec-62 4:5064 Turing machine for even and odd palindrome example in hindi | TOC | lec-63 2:1465 Turing machine for 2's complement in hindi | TOC | lec-64 1:0266 Turing machine to compute function in theory of computation | TOC | lec-65 3:3167 Turing machine for addition and subtraction in toc | TOC | lec-66 1:4668 Recursive and Recursive enumerable languages | TOC | lec-67 2:0669 Halting Problem and Rice theorem | TOC | lec-68 3:1970 Chomsky hierarchy of grammar in theory of computation | TOC | lec-69 2:4571 P, NP, NP hard, NP Complete classes of language in theory of computation | TOC | lec-70 2:0072 Hamiltonian path problems with Example in theory of computation | TOC | lec-71 2:2473 Travelling salesman problem in Theory of computation in hindi | TOC | lec-72 2:1174 Can u prove this in theory of computation? | 1M$ Prize problem in theory of computation | TOC | lec-73