Gate Smashers
Videos from Gate Smashers
Page 4 of 7 • 160 total videos
6:56
Recursive vs Recursively Enumerable Languages 📚
Gate Smashers
394.7K views
11:18
Designing a Turing Machine for a^n b^n c^n
Gate Smashers
723.8K views
11:56
Designing a Turing Machine for a^n b^n | Step-by-Step Tutorial 🖥️
Gate Smashers
964.8K views
4:37
LBA (Linear Bounded Automata) Explained | Complete Theory & Key Points 🚀
Gate Smashers
368.7K views
12:03
SDLC for Beginners: Complete Guide with Real-Life Examples 🚀
Gate Smashers
2.4M views
20:54
Lec-8: Essential OS Security & Protection Concepts Explained 🔒 | Complete Operating System Playlist
Gate Smashers
457.3K views
15:32
L-3.7: Insertion Sort - Time Complexity, Stability, and In-Place Sorting Analysis
Gate Smashers
991.3K views
9:55
Understanding File Systems in Windows, Linux, Unix & Android 📁
Gate Smashers
1.1M views
10:13
Lec-100: Mastering B-Trees – Structure, Pointers & Keys Explained 📚
Gate Smashers
1.1M views
9:03
Turing Machine Explained in Hindi: Basics & Definition 📚
Gate Smashers
1.1M views
7:10
Remove Unit Production from CFG in Hindi
Gate Smashers
452.7K views
7:48
Lec-54: Removing Null Productions from Context-Free Grammar with Example in Hindi
Gate Smashers
506.0K views
13:13
Designing a PDA for the 0ⁿ1²ⁿ Context-Free Language | Essential Tutorial
Gate Smashers
1.2M views
10:58
Pushdown Automata (PDA) Explained in Hindi | Complete TOC Guide 📚
Gate Smashers
1.3M views
15:48
Lec-48: Converting Context-Free Languages to Context-Free Grammars with Examples | TOC
Gate Smashers
1.1M views
7:57
Understanding Context-Free Grammar in Theory of Computation (TOC) 📚
Gate Smashers
1.4M views
4:03
Lec-46: Introduction to CFL & CFG – Concepts, Syllabus & More 📚
Gate Smashers
410.0K views
7:57
Decidability & Undecidability Table Explained | All Languages in TOC 📊
Gate Smashers
266.7K views
5:32
Homomorphism in Regular Languages: Closure Properties Explained 📚
Gate Smashers
176.2K views
3:06
Lec-36: Regular languages Not Closed under Infinite Union | TOC
Gate Smashers
156.9K views
6:28
Lec-33: Reversal Operation in Theory of Computation
Gate Smashers
285.7K views
5:50
Lec-35: Understanding the INIT Operation in Theory of Computation 🔍
Gate Smashers
157.6K views
12:00
Lec-31: Understanding the Pumping Lemma for Regular Languages in Theory of Computation
Gate Smashers
1.3M views
8:29
Master Regular Expressions for Finite Languages | Lec-28 with Examples 📚
Gate Smashers
780.6K views