Playlist Duration

Playlist · Gate Smashers

TOC(Theory of Computation)

by Gate Smashers · 69 videos

Total watch time

10h 47m

at 1× speed · exactly 10 hours, 46 minutes, 50 seconds at 1×

At an hour a day you'd finish in 11 days

The shape of the course

69 videos in blocks of 10 · each column is a block's total, to scale

1h 27m
1h 36m
1h 31m
1h 31m
1h 23m
1h 34m
1h 45m

WatchedTo watch

Compare Open on YouTube JSON

Next time, skip the copying: change youtube.com to playlistduration.com in any playlist, video or channel address and it opens here. Or see the total on YouTube itself, with our extension for Chrome, Firefox or Edge.

Your plan

Plan to finish

About 11 days at an hour a day

Pick a daily pace and the days you'll watch. Ticked videos are skipped.

Days

At one hour a day, every day, this playlist takes about 11 days. Turn on JavaScript to plan around your week.

Videos (69)

10h 47m in total · tick what you've watched

Tick videos you've watched — progress is saved in this browser. Titles open on YouTube in a new tab.

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

Embed a badge

Show the watch time in a README or course description — it links back here and updates itself

Watch time: 10h 47m · 69 videos

Markdown
[![Watch time: 10h 47m · 69 videos](https://playlistduration.com/badge/playlist/PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i.svg)](https://playlistduration.com/playlist/PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i)
HTML
<a href="https://playlistduration.com/playlist/PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i"><img src="https://playlistduration.com/badge/playlist/PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i.svg" alt="Watch time: 10h 47m · 69 videos" width="210" height="20"></a>

Add ?speed=1.5 to the image URL for the time at that speed, ?label=Course to change the left text, or ?style=flat-square for square corners.

Want the numbers themselves? GET https://playlistduration.com/api/v1/playlist/PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i returns them as JSON — free, no key. API docs →

Data from the YouTube Data API as of 2026-10-20 (cached). Private or deleted videos are excluded from totals.