Gate Smashers Theory of Computation: study plan and how long it takes
The Gate Smashers playlist is 69 videos and 10.8 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
69 videos · 10.8 hours · Gate Smashers
Gate Smashers' TOC playlist goes from DFA construction with many examples to NFAs, Mealy and Moore machines, regular expressions, context-free grammars and derivations, normal forms, pushdown automata, Turing machines and decidability, ending with the most important exam questions.
Lots of worked DFA examples make it especially good for practice.
Who it's for: GATE, UGC NET and university students studying automata theory.
How long does it take?
The full playlist is 10.8 hours across 69 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 22 days | 15 days | 11 days |
| 1 h a day | 11 days | 8 days | 6 days |
| 2 h a day | 6 days | 4 days | 3 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–44 · 6h 31m
Day 1 · 57m
- 1Lec-1: Syllabus of TOC(Theory of Computation) for GATE | UGC NTA NET | Imp Points6m
- 2Lec-2: Introduction to TOC | What is Language in TOC with Examples in Hindi12m
- 3Lec-3: What is Automata in TOC | Theory of Computation5m
- 4Lec-4: Power of Sigma Σ in TOC | Kleene closure in TOC9m
- 5Lec-5: What is Grammar in TOC | Must Watch11m
- 6Lec-6: What is DFA in TOC with examples in hindi13m
Day 2 · 54m
- 7Lec-7: DFA Example 1 | How to Construct DFA in TOC8m
- 8Lec-8: DFA Example 2 | DFA of language with all strings end with 'a'6m
- 9Lec-9 : DFA of language with all strings starting with 'a' & ending with 'b' | DFA Example9m
- 10Lec-10: DFA of language with all strings Not starting with 'a' OR Not ending with 'b' | DFA Example7m
- 11Lec-11: DFA of all binary strings divisible by 3 | DFA Example 57m
- 12Lec-12: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' | DFA Example 67m
- 13Lec-13: DFA for Even a and Even b | Even a Odd b | Odd a and Even b | Odd a Odd b | TOC10m
Day 3 · 54m
- 14lec-14 : Equivalence of DFA with examples9m
- 15Lec-15: Minimization of DFA in Hindi with example | TOC18m
- 16Lec-16: Limitations of DFA and Applications of DFA in TOC in Hindi13m
- 17Lec-17: What is NFA in TOC in Hindi | Non Deterministic Finite Automata9m
- 18Lec-18: Design NFA of all binary strings in which 2nd last bit is 1 | NFA Designing | TOC in Hindi6m
Day 4 · 54m
- 19Lec-19: DFA vs NFA in TOC in Hindi with examples | Must Watch8m
- 20Lec-20: Convert NFA to DFA with example in Hindi | How to Convert NFA to DFA10m
- 21Lec-21: Epsilon NFA in hindi | ε-NFA Formal Definition8m
- 22Lec-22: Eliminate Epsilon ε-moves | Conversion from epsilon nfa to nfa8m
- 23Lec-23: Conversion from Epsilon ε-NFA to DFA with example | Eliminate Epsilon ε-moves11m
- 24Lec-24: Moore Machine in TOC with example | What is Moore Machine in Hindi10m
Day 5 · 55m
- 25Lec-25: Mealy Machine in TOC | Formal Definition | Mealy Machine in Hindi8m
- 26Lec-26: Difference between Mealy and Moore Machine in Hindi | All imp points8m
- 27Lec-27: Moore to Mealy Conversion with example in Hindi | TOC9m
- 28Lec-28: Mealy to Moore Conversion with Example in Hindi12m
- 29Lec-29: Regular Expressions in TOC with examples | Formal Definition10m
- 30Lec-30: Regular Expressions for Finite Languages Example 1 | TOC8m
Day 6 · 58m
- 31Lec-31: Regular Expressions for Infinite Languages Example 2 | TOC14m
- 32Lec-32: Important Question on Regular Expressions for all Competitive Exams | TOC6m
- 33Lec-33: Pumping lemma for regular languages in TOC with examples12m
- 34Lec-34: Closure properties of regular languages in TOC10m
- 35Lec-35: Quotient operation in toc with example | Closure Properties10m
- 36Lec-36: Reversal Operation in toc | How regular languages closured under reversal6m
Day 7 · 1h
- 37Lec-37: INIT Operation in TOC6m
- 38Lec-38: Regular languages Not Closed under Infinite Union | TOC3m
- 39Lec-39: Closure Properties Of Various Languages in TOC | Theory Of Computation13m
- 40Lec-40: Languages, Automata, Grammars in TOC | Comparison between them12m
- 41Lec-41: Homomorphism in Regular Languages | closure Properties | TOC6m
- 42Lec-42: Inverse Homomorphism in Regular Languages | Closure Properties in TOC7m
- 43Lec-43: CFL and CFG Introduction and Syllabus discussion4m
- 44Lec-44: Closure Properties of CFL (Context Free Languages) with explanation in Hindi9m
Week 2Videos 45–69 · 4h 16m
Day 8 · 57m
- 45Lec-45: Question on DCFL and CFL in toc11m
- 46Lec-46: What is Context free grammar in TOC | Formal Definition8m
- 47Lec-47: Convert Context free language to Context free grammar with examples | TOC16m
- 48Lec-48: Derivation Tree 🌲Parse Tree 🌲 with example in TOC & Compiler design7m
- 49Lec-49: Left Most & Right Most Derivation in CFG | TOC6m
- 50Lec-37: Ambiguous vs Unambiguous Grammar with examples | Conversion Ambiguous ➡️ Unambiguous10m
Day 9 · 55m
- 51Lec-50: Recursive vs Non-Recursive CFG with examples | Classification of CFG6m
- 52Lec-51: Remove Unit Production from CFG(Context Free Grammar) in Hindi7m
- 53Lec-52: Remove Null Production from CFG (Context Free Grammar) with example in Hindi8m
- 54Lec-53: CYK Algorithm | Membership Algorithm in CFG | TOC17m
- 55Lec-54: CNF Vs GNF | Chomsky vs Greibach Normal Form | CFG in TOC7m
- 56Lec-55: What is Pushdown Automata in TOC | Definition & Explanation in Hindi11m
Day 10 · 50m
- 57Lec-56: Design PDA for 0^n1^2n CFL Language | Very Important| Must Watch13m
- 58Lec-57: Design PDA for {w | na(w) = nb(w)} CFL language | Pushdown automata | TOC11m
- 59Lec-58: What is LBA(Linear Bounded Automata) | All Points Covered | Theory of Automata5m
- 60Lec-59: Introduction to Turing Machine and its Definition in Hindi | TOC9m
- 61Lec-60: Turing Machine for a^nb^n | Design Turing Machine12m
Day 11 · 52m
- 62Lec-61: Turing Machine for a^nb^nc^n | Design Turing Machine11m
- 63Lec-62: Turing Machine for 1's Complement | Transition Table & Diagram8m
- 64Lec-63: Modifications in Turing machine9m
- 65Lec-64: Recursive vs Recursive Enumerable Languages | TOC7m
- 66Lec-65: Decidability & Undecidability table in toc for all languages8m
- 67Lec-66: Important Question on Decidability and closure property | TOC9m
Day 12 · 41m
- 68Lec-67: TOC Most Imp 10 Questions with explanation | 10 Questions for every exam32m
- 69Lec-68: TOC Most Imp 10 Questions for Every Exam | TOP 10 Imp questions of Theory of Computation9m
Tips for finishing
- Build each DFA yourself before watching the solution; the examples are only useful if you attempt them first.
- Save the final 'most important questions' video for the week before your exam.