7.1 NP Completeness | Complexity Theory | TOC | Theory Of Computation | Automata Theory
21:56
7.1 NP Completeness | Complexity Theory | TOC | Theory Of Computation | Automata Theory
289.2K viewsNov 22, 2016
YouTubeKnowledgeGATE by Sanchit Sir
2.12 Every string must start with either 'aa' or 'bb' | TOC | Theory of Computation | Automata
8:05
2.12 Every string must start with either 'aa' or 'bb' | TOC | Theory of Computation | Automata
152.3K viewsApr 8, 2018
YouTubeKnowledgeGATE by Sanchit Sir
2.11 Every string must start and ends with same symbol | TOC | Theory of Computation | Automata
7:04
2.11 Every string must start and ends with same symbol | TOC | Theory of Computation | Automata
178.3K viewsApr 7, 2018
YouTubeKnowledgeGATE by Sanchit Sir
2.14 Every string must contain with either 'aa' or 'bb' | TOC | Theory of Computation | Automata
5:45
2.14 Every string must contain with either 'aa' or 'bb' | TOC | Theory of Computation | Automata
129.5K viewsApr 9, 2018
YouTubeKnowledgeGATE by Sanchit Sir
2.13 Every string must ends with either 'aa' or 'bb' | TOC | Theory Of Computation | Automata
7:11
2.13 Every string must ends with either 'aa' or 'bb' | TOC | Theory Of Computation | Automata
143.5K viewsApr 8, 2018
YouTubeKnowledgeGATE by Sanchit Sir
5.12 Important GATE Questions | Converting Finite Automata to Regular Expression | Automata Theory
14:34
5.12 Important GATE Questions | Converting Finite Automata to Regular Expression | Automata Theory
26.2K viewsMar 3, 2023
YouTubeKnowledgeGATE by Sanchit Sir
6.12 Finite Automata to Regular Grammar Directly | Theory Of Computation | Automata Theory | TOC
8:34
6.12 Finite Automata to Regular Grammar Directly | Theory Of Computation | Automata Theory | TOC
83.4K viewsJun 11, 2022
YouTubeKnowledgeGATE by Sanchit Sir
16:36
13.1 Basics of Turing Machine | Theory of Computation | Automata Theory | TOC
632.5K viewsNov 1, 2017
YouTubeKnowledgeGATE by Sanchit Sir
14:26
2.31 Practice Question and Examples on Minimization Of Finite Automata | Theory of Computation
110.8K viewsJun 8, 2022
YouTubeKnowledgeGATE by Sanchit Sir
11:19
5.15 Important PYQs on Regular Expressions to Finite Automata | Theory of Computation | Automata
32.2K viewsMar 4, 2023
YouTubeKnowledgeGATE by Sanchit Sir
14:48
2.6 string ending with a substring w | TOC | DETERMINISTIC FINITE AUTOMATA | DFA CONSTRUCTION
217.5K viewsApr 6, 2018
YouTubeKnowledgeGATE by Sanchit Sir
6:28
2.18 Every string must be like |w|x=r(mod n) | Theory of Computation | Automata Theory
115K viewsApr 11, 2018
YouTubeKnowledgeGATE by Sanchit Sir
10:34
2.5 Strings in Deterministic Finite Automata | DFA | TOC | AUTOMATA THEORY
228.1K viewsApr 5, 2018
YouTubeKnowledgeGATE by Sanchit Sir
9:48
2.16 Every string must be like |w|=2 | TOC | Theory of Computation | Automata Theory
126.3K viewsApr 10, 2018
YouTubeKnowledgeGATE by Sanchit Sir
8:35
6.11 Regular Grammar to Finite Automata Conversion Directly | Theory of Computation | Automata | TOC
114.4K viewsJun 10, 2022
YouTubeKnowledgeGATE by Sanchit Sir
7:44
2.15 Every string must be like |w|=2 | TOC | Theory of Computation | Automata Theory
141.8K viewsApr 9, 2018
YouTubeKnowledgeGATE by Sanchit Sir
11:11
2.4 Deterministic Finite Automata | DFA | TOC| | Regular Language | Automata Theory
270.5K viewsApr 4, 2018
YouTubeKnowledgeGATE by Sanchit Sir
12:54
2.19 Important GATE PYQs | Deterministic Finite Automata DFA | Theory of Computation
37.3K viewsFeb 15, 2023
YouTubeKnowledgeGATE by Sanchit Sir
7:04
2.8 String containing a substring "w" | DFA | TOC | Theory of Computation | Automata Theory
153.5K viewsApr 7, 2018
YouTubeKnowledgeGATE by Sanchit Sir
12:58
9.7 Problem Solving on Pushdown Automata | Theory of Computation | TOC
58.8K viewsApr 25, 2023
YouTubeKnowledgeGATE by Sanchit Sir
8:49
2.17 Every string must be like |w|=2 such that |w|= r (mod n ) | Theory of Computation | Automata
146.7K viewsApr 10, 2018
YouTubeKnowledgeGATE by Sanchit Sir
17:26
13.2 Turing Machine for a^n b^n | Turing Machine in TOC | Theory of Computation | Automata Theory
567.1K viewsNov 1, 2017
YouTubeKnowledgeGATE by Sanchit Sir
10:14
7.2 Decidable | Undecidable | Complexity Theory | NP Completeness | TOC | THEORY OF COMPUTATION
246.5K viewsDec 7, 2016
YouTubeKnowledgeGATE by Sanchit Sir
1:07:30
NFA Part-2 🧩 | 🎯 GATE 2026 TOC by Sanchit Sir ✨ | 🔴 KnowledgeGate LIVE 🚀 @ 7:30 PM 📅
709 views4 months ago
YouTubeKnowledgeGATE by Sanchit Sir
12:02
2.2 How to Design Deterministic Finite Automata (DFA) | Theory of Computation | Automata Theory
839K viewsApr 3, 2018
YouTubeKnowledgeGATE by Sanchit Sir
18:41
9.2 Pushdown Automata PDA | Pushdown Automata explained in Detail | Theory of Computation | TOC
662.6K viewsAug 30, 2017
YouTubeKnowledgeGATE by Sanchit Sir
6:20
6.7 Type 3 Grammar | TOC | Theory of Computation | Automata Theory
214.6K viewsMar 23, 2018
YouTubeKnowledgeGATE by Sanchit Sir
3.10 Important GATE - NET Questions | Non-Deterministic Finite Automata(NFA) | Theory of Computation
11:37
Find in video from 02:08GATE 2014
3.10 Important GATE - NET Questions | Non-Deterministic Finite Automata(…
24.6K viewsFeb 25, 2023
YouTubeKnowledgeGATE by Sanchit Sir
13:07
5.16 GATE Questions on Regular Expressions to Finite Automata | Theory of Computation | Automata
18.9K viewsMar 5, 2023
YouTubeKnowledgeGATE by Sanchit Sir
6:51
2.23 How many different DFA can be designed for 2 states and they accept empty languages? | Auotmata
72.7K viewsApr 15, 2018
YouTubeKnowledgeGATE by Sanchit Sir
See more