Neso Academy Theory of Computation: study plan and how long it takes
The Neso Academy playlist is 114 videos and 19.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.
114 videos · 19.8 hours · Neso Academy
Neso Academy's Theory of Computation course covers finite automata, NFA to DFA conversion and minimization, Mealy and Moore machines, regular expressions and the pumping lemma, context-free grammars and normal forms, pushdown automata, Turing machines and undecidability, including the halting problem.
It's methodical and thorough, with solved examples throughout.
Who it's for: CS students and GATE aspirants who want a rigorous, example-driven TOC course.
How long does it take?
The full playlist is 19.8 hours across 114 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 | 40 days | 27 days | 20 days |
| 1 h a day | 20 days | 14 days | 10 days |
| 2 h a day | 10 days | 7 days | 5 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 4 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–38 · 6h 21m
Day 1 · 59m
- 1Introduction to Theory of Computation12m
- 2Finite State Machine (Prerequisites)16m
- 3Finite State Machine (Finite Automata)11m
- 4Deterministic Finite Automata (Example 1)10m
- 5Deterministic Finite Automata (Example 2)11m
Day 2 · 50m
- 6Deterministic Finite Automata (Example 3)17m
- 7Deterministic Finite Automata (Example 4)11m
- 8Regular Languages7m
- 9Operations on Regular Languages8m
- 10Non-Deterministic Finite Automata6m
Day 3 · 54m
- 11Formal Definition of Non-Deterministic Finite Automata (NFA)11m
- 12Non-Deterministic Finite Automata (Solved Example 1)7m
- 13Non-Deterministic Finite Automata (Solved Example 2)9m
- 14Non-Deterministic Finite Automata (Solved Example 3)9m
- 15Conversion of NFA to DFA9m
- 16Conversion of NFA to DFA (Example 1)9m
Day 4 · 54m
- 17Conversion of NFA to DFA (Example 2)12m
- 18Conversion of NFA to DFA (Example 3)8m
- 19Conversion of NFA to DFA (Example 4)12m
- 20Minimization of Deterministic Finite Automata (DFA)6m
- 21Minimization of DFA (Example 1)16m
Day 5 · 47m
- 22Minimization of DFA (Example 2)11m
- 23Minimization of DFA (With Multiple Final States)9m
- 24Minimization of DFA (With Unreachable States)7m
- 25Myhill Nerode Theorem - Table Filling Method20m
Day 6 · 1h
- 26Myhill Nerode Theorem - Table Filling Method (Example)15m
- 27Finite Automata With Outputs11m
- 28Construction of Mealy Machine9m
- 29Construction of Mealy Machine (Example 1)7m
- 30Construction of Mealy Machine (Example 2)9m
- 31Construction of Moore Machine9m
Day 7 · 57m
- 32Construction of Moore Machine (Example 1)10m
- 33Construction of Moore Machine (Example 2)6m
- 34Conversion of Moore Machine to Mealy Machine7m
- 35Conversion of Moore Machine to Mealy Machine (Example 1)6m
- 36Conversion of Moore Machine to Mealy Machine (Example 2)7m
- 37Conversion of Mealy Machine to Moore Machine11m
- 38Conversion of Mealy Machine to Moore Machine (Example 1)11m
Week 2Videos 39–81 · 6h 19m
Day 8 · 59m
- 39Conversion of Mealy Machine to Moore Machine (Example 2)10m
- 40Conversion of Mealy Machine to Moore Machine (Using Transition Table)9m
- 41Epsilon NFA6m
- 42Conversion of Epsilon NFA to NFA10m
- 43Conversion of Epsilon NFA to NFA - Examples (Part 1)7m
- 44Conversion of Epsilon NFA to NFA - Examples (Part 2)7m
- 45Regular Expression5m
- 46Regular Expression - Examples6m
Day 9 · 1h
- 47Identities of Regular Expression7m
- 48Arden’s Theorem8m
- 49An Example Proof using Identities of Regular Expressions6m
- 50Designing Regular Expressions7m
- 51NFA to Regular Expression Conversion14m
- 52DFA to Regular Expression Conversion6m
- 53DFA to Regular Expression Conversion (when the DFA has Multiple Final States)8m
- 54Conversion of Regular Expression to Finite Automata4m
Day 10 · 47m
- 55Conversion of Regular Expression to Finite Automata - Examples (Part 1)9m
- 56Conversion of Regular Expression to Finite Automata - Examples (Part 2)6m
- 57Conversion of Regular Expression to Finite Automata - Examples (Part 3)7m
- 58Equivalence of Two Finite Automata11m
- 59Equivalence of Two Finite Automata (Example)6m
- 60Pumping Lemma (For Regular Languages)8m
Day 11 · 51m
- 61Pumping Lemma (For Regular Languages) | Example 114m
- 62Pumping Lemma (For Regular Languages) | Example 29m
- 63Regular Grammar10m
- 64Derivations from a Grammar10m
- 65Context Free Grammar & Context Free Language8m
Day 12 · 57m
- 66Regular Languages & Finite Automata (Solved Problem 1)19m
- 67Regular Languages & Finite Automata (Solved Problem 2)4m
- 68Regular Languages & Finite Automata (Solved Problem 3)11m
- 69Regular Languages & Finite Automata (Solved Problem 4)12m
- 70Regular Languages & Finite Automata (Solved Problem 5)5m
- 71Regular Languages & Finite Automata (Solved Problem 6)6m
Day 13 · 52m
- 72Method to find whether a String belongs to a Grammar or not12m
- 73Derivation Tree (Left & Right Derivation Trees)13m
- 74Ambiguous Grammar6m
- 75Simplification of CFG (Reduction of CFG)14m
- 76Simplification of CFG (Removal of Unit Productions)9m
Day 14 · 53m
- 77Simplification of CFG (Removal of Null Productions)9m
- 78Chomsky Normal Form & CFG to CNF Conversion7m
- 79Conversion of CFG to Chomsky Normal Form13m
- 80Greibach Normal Form & CFG to GNF Conversion13m
- 81CFG to GNF Conversion (Removal of Left Recursion)11m
Week 3Videos 82–111 · 6h 19m
Day 15 · 55m
- 82Pumping Lemma (For Context Free Languages)8m
- 83Pumping Lemma (For Context Free Languages) - Examples (Part 1)12m
- 84Pumping Lemma (For Context Free Languages) - Examples (Part 2)18m
- 85Pushdown Automata (Introduction)7m
- 86Pushdown Automata (Formal Definition)9m
Day 16 · 1h
- 87Pushdown Automata (Graphical Notation)12m
- 88Pushdown Automata Example - Even Palindrome (Part 1)14m
- 89Pushdown Automata Example - Even Palindrome (Part 2)19m
- 90Pushdown Automata Example - Even Palindrome (Part 3)14m
Day 17 · 45m
- 91Equivalence of CFG and PDA (Part 1)23m
- 92Equivalence of CFG and PDA (Part 2a)22m
Day 18 · 58m
- 93Equivalence of CFG and PDA (Part 2b)20m
- 94Turing Machine - Introduction (Part 1)8m
- 95Turing Machine - Introduction (Part 2)10m
- 96Turing Machine (Formal Definition)10m
- 97Turing Machine (Example 1)11m
Day 19 · 55m
- 98Turing Machine (Example 2)14m
- 99The Church-Turing Thesis13m
- 100Turing Machine for Even Palindromes16m
- 101Turing Machine Programming Techniques (Part 1)11m
Day 20 · 51m
- 102Turing Machine Programming Techniques (Part 2)10m
- 103Turing Machine Programming Techniques (Part 3)8m
- 104Multitape Turing Machine18m
- 105Nondeterministic Turing Machine (Part 1)16m
Day 21 · 58m
- 106Nondeterministic Turing Machine (Part 2)14m
- 107Turing Machine as Problem Solvers12m
- 108Decidability and Undecidability8m
- 109Universal Turing Machine8m
- 110The Halting Problem7m
- 111Undecidability of the Halting Problem8m
Week 4Videos 112–114 · 50m
Day 22 · 50m
- 112The Post Correspondence Problem14m
- 113Undecidability of the Post Correspondence Problem28m
- 114TOC – Conclusion and Summary8m
Tips for finishing
- Finish the finite automata chapters before moving on; everything later builds on them.
- The final summary video is a good revision tool the week before an exam.