6:03
Lec-1: Syllabus of TOC(Theory of Computation) for GATE | UGC NTA NET | Imp Points
Gate Smashers
12:21
Lec-2: Introduction to TOC | What is Language in TOC with Examples in Hindi
5:18
Lec-3: What is Automata in TOC | Theory of Computation
8:31
Lec-4: Power of Sigma Σ in TOC | Kleene closure in TOC
11:08
Lec-5: What is Grammar in TOC | Must Watch
13:14
Lec-6: What is DFA in TOC with examples in hindi
8:12
Lec-7: DFA Example 1 | How to Construct DFA in TOC
5:51
Lec-8: DFA Example 2 | DFA of language with all strings end with 'a'
8:34
Lec-9 : DFA of language with all strings starting with 'a' & ending with 'b' | DFA Example
7:24
Lec-10: DFA of language with all strings Not starting with 'a' OR Not ending with 'b' | DFA Example
7:19
Lec-11: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' | DFA Example 6
7:26
Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5
9:01
Lec-13: What is NFA in TOC in Hindi | Non Deterministic Finite Automata
7:57
Lec-14: DFA vs NFA in TOC in Hindi with examples | Must Watch
6:09
Lec-15: Design NFA of all binary strings in which 2nd last bit is 1 | NFA Designing | TOC in Hindi
9:37
Lec-16: Convert NFA to DFA with example in Hindi | How to Convert NFA to DFA
9:35
Lec-17: DFA for Even a and Even b | Even a Odd b | Odd a and Even b | Odd a Odd b | TOC
7:40
Lec-18: Eliminate Epsilon ε-moves | Conversion from epsilon nfa to nfa
12:40
Lec-19: Limitations of DFA and Applications of DFA in TOC in Hindi
9:51
Lec-20: Moore Machine in TOC with example | What is Moore Machine in Hindi
7:45
Lec-21: Mealy Machine in TOC | Formal Definition | Mealy Machine in Hindi
7:55
Lec-22: Difference between Mealy and Moore Machine in Hindi | All imp points
8:46
Lec-23: Moore to Mealy Conversion with example in Hindi | TOC
12:11
Lec-24: Mealy to Moore Conversion with Example in Hindi
Lec-25: Epsilon NFA in hindi | ε-NFA Formal Definition
17:36
Lec-26: Minimization of DFA in Hindi with example | TOC
9:59
Lec-27: Regular Expressions in TOC with examples | Formal Definition
8:29
Lec-28: Regular Expressions for Finite Languages Example 1 | TOC
13:46
Lec-29: Regular Expressions for Infinite Languages Example 2 | TOC
Lec-30: Important Question on Regular Expressions for all Competitive Exams | TOC
12:00
Lec-31: Pumping lemma for regular languages in TOC with examples
9:33
Lec-32: Closure properties of regular languages in TOC
6:28
Lec-33: Reversal Operation in toc | How regular languages closured under reversal
9:52
Lec-34: Quotient operation in toc with example | Closure Properties
5:50
Lec-35: INIT Operation in TOC
3:06
Lec-36: Regular languages Not Closed under Infinite Union | TOC
12:33
Lec-37: Closure Properties Of Various Languages in TOC | Theory Of Computation
Lec-38: Languages, Automata, Grammars in TOC | Comparison between them
11:05
Lec-39: Question on DCFL and CFL in toc
8:38
Lec-40: Important Question on Decidability and closure property | TOC
8:55
Lec-41: TOC Most Imp 10 Questions for Every Exam | TOP 10 Imp questions of Theory of Computation
31:39
Lec-42: TOC Most Imp 10 Questions with explanation | 10 Questions for every exam
5:32
Lec-43: Homomorphism in Regular Languages | closure Properties | TOC
7:13
Lec-44: Inverse Homomorphism in Regular Languages | Closure Properties in TOC
Lec-45: Decidability & Undecidability table in toc for all languages
4:03
Lec-46: CFL and CFG Introduction and Syllabus discussion
Lec-47: What is Context free grammar in TOC | Formal Definition
15:48
Lec-48: Convert Context free language to Context free grammar with examples | TOC
6:22
Lec-49: Left Most & Right Most Derivation in CFG | TOC
10:58
Lec-50: What is Pushdown Automata in TOC | Definition & Explanation in Hindi
13:13
Lec-51: Design PDA for 0^n1^2n CFL Language | Very Important| Must Watch
11:25
Lec-52: Design PDA for {w | na(w) = nb(w)} CFL language | Pushdown automata | TOC
8:57
Lec-53: Closure Properties of CFL (Context Free Languages) with explanation in Hindi
7:48
Lec-54: Remove Null Production from CFG (Context Free Grammar) with example in Hindi
7:10
Lec-55: Remove Unit Production from CFG(Context Free Grammar) in Hindi
9:03
Lec-56: Introduction to Turing Machine and its Definition in Hindi | TOC
4:37
Lec-57: What is LBA(Linear Bounded Automata) | All Points Covered | Theory of Automata
11:56
Lec-58: Turing Machine for a^nb^n | Design Turing Machine
11:18
Lec-59: Turing Machine for a^nb^nc^n | Design Turing Machine
6:56
Lec-60: Recursive vs Recursive Enumerable Languages | TOC
8:06
Lec-61: Turing Machine for 1's Complement | Transition Table & Diagram
9:20
Lec-62: Modifications in Turing machine
17:10
Lec-63: CYK Algorithm | Membership Algorithm in CFG | TOC
6:33
Lec-64: CNF Vs GNF | Chomsky vs Greibach Normal Form | CFG in TOC
Lec-65: Derivation Tree 🌲Parse Tree 🌲 with example in TOC & Compiler design
5:44
Lec-66: Recursive vs Non-Recursive CFG with examples | Classification of CFG
9:30
Lec-37: Ambiguous vs Unambiguous Grammar with examples | Conversion Ambiguous ➡️ Unambiguous
10:46
Lec-68: Conversion from Epsilon ε-NFA to DFA with example | Eliminate Epsilon ε-moves
8:51
Equivalence of DFA with examples
