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