Video Lectures of Theory of Computation (Video Lectures) for Computer Science Engineering (CSE) Exam
Watch free video lectures for Theory of Computation (Video Lectures) covering all chapters/topics as per the latest syllabus in 2026. These concept videos, recorded lectures, and audio notes are designed to help Computer Science Engineering (CSE) students understand every topic clearly — anytime, anywhere. Start learning on EduRev.
Fundamentals of TOC
| Definition of TOC and Formal Language | Fundamentals of TOC |Theory Of Computation | GATE CSE 11:04 min |  |
| Grammar | Fundamentals of TOC |Theory Of Computation | GATE COMPUTER SCIENCE ENGINEERING 07:59 min | |
| Automata | Fundamentals of Theory Of Computation | Theory Of Computation | GATE CSE 01:59 min | |
| Expressing Power of Automata | Fundamentals of TOC | Theory Of Computation | GATE CSE 17:38 min | |
| Automata Question 1 Explained | Cracking GATE Computer Science Engineering 02:05 min | |
| Automata Question 2 Explained | Cracking GATE Computer Science Engineering 04:21 min | |
| Expert Tips: Limited Memory Finite Automata for | GATE Computer Science Engineering 16:28 min | |
| Symbol and Alphabet Concepts for | GATE Computer Science Engineering 04:19 min | |
| Empty String Fundamentals for | GATE Computer Science Engineering 01:57 min | |
| Understanding Substrings and Their Types in | Gate Computer Science Engineering 12:19 min | |
| Prefix and Suffix Subject Explained for | GATE Computer Science Engineering 04:36 min | |
| Reverse of String | Exam Preparation |GATE Computer Science Engineering 02:07 min | |
| Learn String Concatenation for | GATE Computer Science Engineering Exam 02:39 min | |
| Power of Alphabet In Theory of Computation for | GATE Computer Science Engineering 10:12 min | |
| Mastering Language in Theory of Computation for | GATE Computer Science Engineering 18:42 min | |
Finite Automata
| Finite Automata | Theory Of Computation | GATE Computer Science Engineering 19:40 min | |
| Representation of FA | Finite Automata | Theory Of Computation | GATE Computer Science Engineering 04:32 min | |
| Architecture or Block Diagram of FA | Finite Automata | Theory Of Computation | GATE CSE 16:24 min | |
| FA Example 1 | Finite Automata | Theory Of Computation | GATE Computer Science Engineering 07:41 min | |
| FA Observations | Finite Automata | Theory Of Computation | GATE Computer Science Engineering 17:27 min | |
| Construction of DFA or FA for Finite Languages | Finite Automata | Theory Of Computation | GATE CSE 17:19 min | |
| Construction of FA that Including Epsilon | Finite Automata | Theory Of Computation | GATE CSE 02:36 min | |
| Construction of FA Excluding Epsilon For | GATE Computer Science Engineering 02:34 min | |
| Construction of FA that Accepts Every String Start with A | GATE Computer Science Engineering 04:24 min | |
| Construction of FA that Accepts Every String Start with AB | GATE Computer Science Engineering 04:28 min | |
| Construction of FA that Accepts Every String Start with BAB | GATE Computer Science Engineering 05:39 min | |
| Construction of FA that Accepts Every String Start with AAA | Finite Automata | GATE CSE 03:37 min | |
| Construction of FA that Accepts Every String Start with Substring of Length M | GATE CSE 04:21 min | |
| Construction of FA that Accepts Every String Ends with B | GATE Computer Science Engineering 04:19 min | |
| Construction of FA that Accepts Every String Ends with BA | GATE Computer Science Engineering 04:21 min | |
| Construction of FA that Accepts Every String Ends with BAB | GATE Computer Science Engineering 05:27 min | |
| Construction of FA that Accepts Every String Contains Sub String B | GATE CSE 02:39 min | |
| Construction of FA that Accepts Every String Contains Sub String AB | GATE Computer Engineering 02:34 min | |
| Construction of FA that Accepts Every String Contains Sub String ABA | GATE CSE 03:31 min | |
| Construct the FA that Accepts all the Strings of a; b where Start and End with a For | GATE CSE 04:20 min | |
| Construct the FA that Accepts all the Strings of a; b where Start & End with same Symbol | GATE CSE 04:00 min | |
| Construct the FA that Accepts all the Strings of a; b where Start & End with Different Symbol | CSE 03:57 min | |
| Construction of FA that Accepts Every String Starts with aa or bb For | GATE Computer Engineering 04:19 min | |
| Construction of FA that Accepts Every String Ends with aa or bb For | GATE Computer Engineering 03:50 min | |
| Construction of FA that Accepts Every String Contains DIBIT as Substring For | GATE CSE 03:40 min | |
| Construction of FA that Accepts Every String Contains TRIBIT as Substring For | GATE CSE 04:43 min | |
| Understanding Construction of FA that Accepts 3rd Symbol from Left End Always B | GATE CSE 03:18 min | |
| Construction of FA that Accepts 4th Symbol from Left End Always A | GATE Computer Science 02:30 min | |
| Construction of FA that Accepts 2nd Symbol from Right End Always B | GATE COMPUTER ENGINEERING 05:26 min | |
| Construction of FA that Accepts 3rd Symbol from Right End Always A | GATE Computer Engineering 14:37 min | |
| Construction of FA that Accepts Each String Contains 2 A's Consecutively | GATE Computer Engineering 03:25 min | |
| Construction of FA that Accepts Each String Contains Exactly 2 A's Consecutively For | GATE CSE 02:31 min | |
| Construction of FA that Accepts Each String Contains Atleast 2 A's | GATE Computer Engineering 01:40 min | |
| Construction of FA that Accepts Each String Contains Atmost 2 A's | GATE Computer Engineering 03:01 min | |
| Construction of FA that Accepts Each String Contains Even Number of A's | GATE Computer Science 03:16 min | |
| Construction of FA that Accepts Each String Contains Odd Number of A's | GATE Computer Engineering 01:37 min | |
| Construction of FA that Accepts Each String Contains Number of B's Divisible By 3 For | GATE CSE 02:38 min | |
| Construction of FA that Accepts Each String Contains Number of A's Congruent to 2 Mod4 In | GATE CSE 04:39 min | |
| Construction of FA that Accepts Each String Contains Number of B's Congruent to 1 Mod4 For |GATE CSE 02:57 min | |
| Construction of FA that Accepts Each String Contains Number of B's Congruent to 1 Mod3 For |GATE CSE 02:17 min | |
| Construction of FA that Accepts Each String Contains Number of B's Congruent to 3Mod5 For |GATE CSE 03:49 min | |
| Construction of FA that Accepts The Length of The String is Atleast 3 In | GATE Computer engineering 01:58 min | |
| Construction of FA that Accepts The Length of The String is Atmost 3 In | GATE Computer Engineering 06:11 min | |
| Construction of FA that Accepts The Length of The String is Congruent to 2Mod3 In | GATE CSE 03:27 min | |
| Construction of FA that Accepts The Length of The String is Congruent to 1Mod4 | GATE CSE 02:27 min | |
| Construction of FA that Accepts The Length of The String is Congruent to 2 Mod5 | GATE CSE 02:45 min | |
| Construction Of FA That Accepts The String Starts With AB And Length of The String Is Congruent To 2 07:08 min | |
| Construction of FA that Accepts The Binary Number is Congruent to 1 Mod4 In | GATE CSE 12:39 min | |
| Construction of FA that Accepts The Binary Number is Congruent to 2 Mod6 | GATE Computer ENGINEERING 05:36 min | |
| Construction of FA that Accepts The Binary Number is Congruent to 2 Mod4 | GATE CSE 02:31 min | |
| Construction of FA that Accepts The Binary Number is Congruent to 1 Mod7 In | GATE CSE 02:36 min | |
| Construction of FA that Accepts The Binary Number is Congruent to 3 Mod8 In | GATE CSE 20:33 min | |
Regular Languages and Regular Expressions
| Regular Expression Part 1 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 10:11 min | |
| Regular Expression Part 2 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 22:27 min | |
| Regular Expression Part 3 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 14:12 min | |
| Regular Expression Part 4 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 17:19 min | |
| Regular Expression Part 5 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 17:44 min | |
| Regular Expression Part 6 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 21:12 min | |
| Regular Expression Part 7 | Regular Languages and Regular Expressions |Theory Of Computation | GATE 11:52 min | |
| Conversion from FA to RE Part 1 |Regular Languages & Regular Expressions |Theory Of Computation |CSE 08:39 min | |
| Conversion from FA to RE Part 2 |Regular Languages & Regular Expressions |Theory Of Computation |CSE 07:59 min | |
| Conversion from FA to RE Part 3 |Regular Languages & Regular Expressions |Theory Of Computation |CSE 08:05 min | |
| Conversion from FA to RE Part 4 |Regular Languages & Regular Expressions |Theory Of Computation |CSE 05:19 min | |
| Conversion from FA to RE Part 5 |Regular Languages & Regular Expressions |Theory Of Computation |CSE 09:02 min | |
| Converting Regular Expressions to Finite Automata - Part 1| Gate Computer Science Engineering 19:06 min | |
| Converting Regular Expressions to Finite Automata - Part 2 | Gate Computer Science Engineering 13:28 min | |
| Converting Regular Expressions to Finite Automata - Part 3 | Gate Computer Science Engineering 07:22 min | |
| Some Formulae for RE | Regular Languages and Regular Expressions |Theory Of Computation |GATE CSE 13:47 min | |
| Converting Regular Expressions to Finite Automata - Part 4 | Gate Computer Science Engineering 04:18 min | |
| Algebraic Properties of RE Part 1 |Regular Languages & Regular Expressions |Theory Of Computation 05:43 min | |
| GATE 2016 Question on RE to FA For GATE Computer Science Engineering 06:50 min | |
| Closer Properties of RE | Regular Languages and Regular Expressions | Theory Of Computation | CSE 19:14 min | |
| Mastering Moore and Mealy Machines |Part 1 |GATE Computer Science Engineering 29:44 min | |
| Mastering Moore and Mealy Machines |Part 2 |GATE Computer Science Engineering 06:08 min | |
| Mastering Moore and Mealy Machines |Part 3 |GATE Computer Science Engineering 13:08 min | |
| Mastering Moore and Mealy Machines |Part 4 |GATE Computer Science Engineering 14:30 min | |
| Conversion from Moore to Mealy Machine | Regular Languages & Regular Expressions Part-1 |GATE CSE 06:38 min | |
| Mealy to Moore Machine Conversion Tutorial Part-1 | GATE Computer Science Engineering 14:55 min | |
| Mealy to Moore Machine Conversion Tutorial Part-2 | GATE Computer Science Engineering 14:30 min | |
| Pumping Lemma Part 1| Regular Languages and Regular Expressions |Theory Of Computation |GATE CSE 09:18 min | |
Introduction to Grammars
| Context-Free Grammar Part 1 | Introduction to Grammars |Theory Of Computation | GATE CSE 12:17 min | |
| Context-Free Grammar Part 2 | Introduction to Grammars |Theory Of Computation | GATE CSE 17:45 min | |
| Context-Free Grammar Part 3 | Introduction to Grammars |Theory Of Computation | GATE CSE 16:18 min | |
| Context-Free Grammar Part 4 | Introduction to Grammars |Theory Of Computation | GATE CSE 12:35 min | |
| Context-Free Grammar Part 5 | Introduction to Grammars |Theory Of Computation | GATE CSE 08:44 min | |
| Context-Free Grammar Part 6 | Introduction to Grammars |Theory Of Computation | GATE CSE 09:17 min | |
| Types of Grammars | Introduction to Grammars |Theory Of Computation | GATE CSE 13:15 min | |
| Regular Grammar Part 1| Introduction to Grammars |Theory Of Computation | GATE CSE 10:23 min | |
| Regular Grammar Part 2 | Introduction to Grammars |Theory Of Computation | GATE CSE 11:21 min | |
CFL and PDA
| Understanding CFL - CFL and PDA - Theory Of Computation | GATE | Computer Science Engineering 07:33 min | |
| Simplification of CFG Part 1 | CFL and PDA | Theory Of Computation |GATE COMPUTER Engineering 06:20 min | |
| Simplification of CFG Part 2 | CFL and PDA | Theory Of Computation |GATE COMPUTER Engineering 15:44 min | |
| Simplification of CFG Part 4 | CFL and PDA | Theory Of Computation |GATE COMPUTER Engineering 11:43 min | |
| Simplification of CFG Part 5 | CFL and PDA | Theory Of Computation |GATE COMPUTER Engineering 12:42 min | |
| Normal Forms CNF Part 1 | CFL and PDA | Theory Of Computation | GATE CSE 10:01 min | |
| Normal Forms CNF Part 2 | CFL and PDA | Theory Of Computation | GATE CSE 08:42 min | |
| Understanding Normal Forms GNF Part 1| GATE Computer Science Engineering 06:13 min | |
| Understanding Normal Forms GNF Part 2 | GATE Computer Science Engineering 11:54 min | |
| Understanding Normal Forms GNF Part 3 | GATE Computer Science Engineering 14:59 min | |
| Understanding Normal Forms GNF Part 4 | GATE Computer Science Engineering 13:47 min | |
| Understanding Normal Forms GNF Part 5 | GATE Computer Science Engineering 07:13 min | |
| Decision Properties of CFG Part 1 | CFL and PDA | Theory Of Computation | GATE CSE 07:42 min | |
| Decision Properties of CFG Part 2 | CFL and PDA | Theory Of Computation | GATE CSE 11:33 min | |
| Decision Properties of CFG Part 4 | CFL and PDA | Theory Of Computation | GATE CSE 06:26 min | |
| Introduction of Push Down Automata PDA | CFL and PDA | Theory Of Computation | GATE CSE 10:45 min | |
| Working of PDA | CFL and PDA | Theory Of Computation | GATE CSE 21:38 min | |
| PDA Construction for Languages - Theory of Computation Part-1|Theory Of Computation |GATE CSE 10:21 min | |
| PDA Construction for Languages - Theory of Computation Part-2|Theory Of Computation |GATE CSE 16:46 min | |
| PDA Construction for Languages - Theory of Computation Part-3|Theory Of Computation |GATE CSE 15:47 min | |
| PDA Construction for Languages - Theory of Computation Part-4|Theory Of Computation |GATE CSE 16:18 min | |
| PDA Construction for Languages - Theory of Computation Part-5|Theory Of Computation |GATE CSE 16:41 min | |
| PDA Construction for Languages - Theory of Computation Part-6|Theory Of Computation |GATE CSE 11:11 min | |
| PDA Construction for Languages - Theory of Computation Part-7|Theory Of Computation |GATE CSE 15:32 min | |
| PDA Construction for Languages - Theory of Computation Part-8|Theory Of Computation |GATE CSE 10:32 min | |
| PDA Construction for Languages - Theory of Computation Part-9|Theory Of Computation |GATE CSE 09:12 min | |
| PDA Construction for Languages - Theory of Computation Part-10 |Theory Of Computation |GATE CSE 12:30 min | |
| PDA Construction for Languages - Theory of Computation Part-11 |Theory Of Computation |GATE CSE 25:11 min | |
| PDA Construction for Languages - Theory of Computation Part-12 |Theory Of Computation |GATE CSE 13:04 min | |
| Closure Properties of CFL Part 1 | CFL and PDA | Theory Of Computation | GATE Computer Engineering 11:50 min | |
| Closure Properties of CFL Part 2 | CFL and PDA | Theory Of Computation | GATE Computer Engineering 17:34 min | |
| Closure Properties of CFL Part 3 | CFL and PDA | Theory Of Computation | GATE Computer Engineering 08:24 min | |
| Pumping Lemma for CFL Part 2 | CFL and PDA | Theory Of Computation | GATE CSE 15:15 min | |
| Pumping Lemma for CFL Part 3 | CFL and PDA | Theory Of Computation | GATE CSE 07:25 min | |
Introduction to Turing Machine
| Turing Machine Part 1 | Introduction to Turing Machine | Theory Of Computation | GATE CSE 07:44 min | |
| Turing Machine Part 2 | Introduction to Turing Machine | Theory Of Computation | GATE CSE 07:36 min | |
| Turing Machine Part 3 | Introduction to Turing Machine | Theory Of Computation | GATE CSE 14:38 min | |
