Name: SyncStudy – YouTube Learning Platform
Brand: SyncStudy
Availability: InStock

Theory of Computation — Free Course | SyncStudy

Course Syllabus

Complete Lecture Curriculum (120 Lectures)

Full index of topics and video runtimes included in this course.

Total: 25h 14m

01
Introduction to Theory of Computation || GATECSE || TOC || TAFL
13:57
Lesson
02
Powers of Alphabet in TOC | Σ* | Kleen Star | GATECSE | TOC
15:52
Lesson
03
Introduction to DFA | Deterministic Finite Automata | TOC | Automata Theory
22:20
Lesson
04
Design DFA | length of the string is exactly 2 | at least 2 | at most 2 | GATECSE | TOC
11:07
Lesson
05
DFA for Number of a's Exactly 2, At Least 2 & At Most 2 | GATE CSE | TOC| Automata Theory
8:56
Lesson
06
Design DFA for Even Number of a's | Number of a's Divisible by 2 | Na(w) mod 2 = 0
9:00
Lesson
07
Design DFA for Even Number of a's and b's | Na(W) mod 2 = 0 and Nb(W) mod 2 = 0 | TOC
11:33
Lesson
08
Design DFA in which no of a's is multiple of 3 and no of b's is multiple of 2 | TOC | Automata
14:57
Lesson
09
Design DFA in which no of a's is multiple of 3 or no of b's is multiple of 2 | TOC | Automata
5:34
Lesson
10
Design DFA for Binary Numbers Divisible by 2 | GATE CSE | Theory of Computation
7:18
Lesson
11
Design DFA binary number divisible by 3 and divisible by 4 | GATECS | TOC
11:14
Lesson
12
Design DFA for Strings Starting with “ab” | GATE CSE | TOC | Automata Theory
7:13
Lesson
13
Design DFA for Strings Containing “ab” as a Substring | DFA Construction | GATE CSE | TOC
4:16
Lesson
14
Design DFA for Strings Ending with “ab” | DFA Construction | GATE CSE | TOC | Automata Theory
5:57
Lesson
15
Design DFA for Strings Starting with ‘a’ and Ending with ‘b’ | GATE CSE | TOC | Automata Theory
5:16
Lesson
16
Design DFA for Strings Starting and Ending with Different Symbols | GATE CSE | TOC | Automata Theory
5:21
Lesson
17
Design DFA in which set of all strings can be accepted that ends with ab or ba | TOC
11:17
Lesson
18
Design DFA for Strings Starting with 01 or Ending with 01 | GATE CSE | TOC | Automata Theory
13:59
Lesson
19
Design DFA in which accepts set of all strings, Second symbol from LHS is a and fifth symbol is b
8:37
Lesson
20
Design DFA for L = {aⁿ | n ≥ 0, n ≠ 2, n ≠ 4} | GATE CSE | TOC | Automata Theory
5:45
Lesson
21
Design DFA for L= a^m b^n / n is greater than or equal to 0 | TOC | Automata
13:33
Lesson
22
Design DFA for L = a^m b^n c^p | m,n,p ≥ 0 | DFA Design | TOC | Automata Theory | GATE CSE
14:04
Lesson
23
DFA which accepts strings of form a^3bwa^3 , where 'w' is any string | DFA design |TOC | Automata
10:38
Lesson
24
Design DFA for Strings Where Every ‘a’ Is Immediately Preceded and Followed by ‘b’ | GATE CSE | TOC
8:06
Lesson
25
Introduction to NFA | Non Deterministic Finite Automata | NFA in TOC
13:39
Lesson
26
NFA to DFA Conversion Example 1 | Conversion from NFA to DFA | TOC | Automata Theory
6:10
Lesson
27
NFA to DFA Conversion Example 2 | Conversion from NFA to DFA | TOC | Automata Theory
6:32
Lesson
28
NFA to DFA Conversion Example 3 | Conversion from NFA to DFA | TOC | Automata Theory
7:00
Lesson
29
Epsilon NFA to DFA Example 1 | epsilon NFA to DFA | TOC | Automata Theory
15:49
Lesson
30
Epsilon NFA to DFA Example 2 | Conversion of Epsilon NFA to DFA | GATECS | TOC
10:26
Lesson
31
Introduction to Regular Expression | Regular Language to Regular Expression | Automata Theory
11:58
Lesson
32
Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC
12:32
Lesson
33
Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC
6:47
Lesson
34
Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC
17:19
Lesson
35
Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC
18:30
Lesson
36
Arden’s Theorem | Finite Automata to Regular Expression | GATECSE | TOC
10:21
Lesson
37
Arden's Theorem Example 1 | Finite Automata to Regular Expression | GATECSE | TOC
5:57
Lesson
38
Arden's Theorem Examples 2 | Finite Automata to Regular Expression | GATECSE | TOC
7:25
Lesson
39
Arden's Theorem Examples 3 | Finite Automata to Regular Expression | GATECSE | TOC
7:18
Lesson
40
Arden's Theorem Example 4 | Finite Automata to Regular Expression | TOC
9:25
Lesson
41
Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC
12:37
Lesson
42
Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC
5:29
Lesson
43
Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC
4:47
Lesson
44
Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC
12:54
Lesson
45
Introduction to Mealy and Moore Machine | TOC | GATECSE
11:01
Lesson
46
Design Mealy Machine for 1's and 2's Complement | TOC | GATECSE
8:42
Lesson
47
Design Moore Machine for print 1 for every occurrence of ab as a substring | TOC
9:00
Lesson
48
Conversion from Moore Machine to Mealy Machine || Example 1 || GATECSE || TOC
7:25
Lesson
49
Conversion from Moore Machine to Mealy Machine || Example 2 || GATECSE || TOC
5:36
Lesson
50
Conversion from Mealy Machine to Moore Machine || Example 1 || GATECSE || TOC
8:00
Lesson
51
Conversion from Mealy Machine to Moore Machine || Example 2 || GATECSE || TOC
7:13
Lesson
52
DFA Minimization || Example 1 || Minimization of DFA || GATE CSE || TOC
13:50
Lesson
53
DFA Minimization || Example 2 || Minimization of DFA || GATE CSE || TOC
13:33
Lesson
54
DFA Minimization || Example 3 || Minimization of DFA || GATE CSE || TOC
8:10
Lesson
55
DFA Minimization || Example 4 || Minimization of DFA || GATE CSE || TOC
15:28
Lesson
56
What is Grammar in TOC || GATECSE || TOC
11:43
Lesson
57
Chomsky Classification of Grammar || GATECSE || TOC
26:13
Lesson
58
Conversion from Language to Grammar || GATECSE || TOC
18:56
Lesson
59
Conversion from Right Linear Grammar to Left Linear Grammar || Regular Grammar || TOC
14:36
Lesson
60
How to identify Regular Language | Testing whether a language is regular or not | GATECSE | TOC
29:03
Lesson
61
Simplification of Context Free Grammar ( Reduction of CFG) |Automata Theory
12:26
Lesson
62
Removal of Null Production | Simplification of CFG | Elimination of Epsilon production | TOC
9:05
Lesson
63
Removal of Unit Production | Simplification of CFG | Elimination of Unit production | TOC
10:31
Lesson
64
Removal of Useless Production | Simplification of CFG | Elimination of Useless production | TOC
12:13
Lesson
65
Chomsky Normal Form | CNF in TOC | CNF Examples | Automata Theory | GATE CSE
15:30
Lesson
66
CFG to CNF Conversion Examples | Chomsky Normal Form Examples | TOC
11:48
Lesson
67
CYK Algorithm | Membership algorithm for CFG | GATECSE | TOC
25:55
Lesson
68
Greibach Normal Form (GNF) | GNF Solved Examples | TOC | GATECS | Automata Theory
7:30
Lesson
69
CFG to GNF Conversion | Context Free Grammar to Greibach Normal Form Conversion | GATECS | TOC
17:56
Lesson
70
Introduction to PDA || Pushdown Automata TOC || Automata Theory
24:38
Lesson
71
Pushdown Automata for L=a^n b^n | PDA for a^n b^n | TOC | Automata Theory
17:41
Lesson
72
Pushdown Automata (PDA) for equal number of ‘a’ and equal number of ‘b’ | GATECSE | TOC
9:52
Lesson
73
Pushdown Automata for aⁿbⁿcᵐ and aⁿbᵐcⁿ || PDA || TOC
6:49
Lesson
74
Pushdown Automata (PDA) for aᵐ⁺ⁿbⁿcᵐ, aⁿbᵐ⁺ⁿcᵐ, aⁿbᵐcᵐ⁺ⁿ || TOC || Automata Theory
16:38
Lesson
75
Construct pda for wcw^r || PDA for Odd Palindrome || TOC || Automata Theory
10:11
Lesson
76
Construct pda for WW^r | NPDA for WW^r | PDA for Even Palindrome | TOC | Automata Theory
15:59
Lesson
77
Pushdown Automata for L=a^n b^2n | PDA for a^n b^2n | Theory of Computation | TOC | Automata Theory
8:01
Lesson
78
PDA for L= a^n b^n UNION a^n b^2n | L= a^n b^n UNION a^n b^2n | Theory of Computation
13:06
Lesson
79
How to check whether a language is cfl or not | CFL, DCFL and Non-CFL | GATECSE | TOC
32:45
Lesson
80
Two Stack PDA | 2 stack PDA for a^n b^n c^n | TOC | Automata Theory
15:48
Lesson
81
Two Stack PDA | 2 stack PDA for a^n b^n c^n d^n | TOC | Automata Theory
12:58
Lesson
82
CFG to PDA Conversion || Equivalence of CFG and PDA || TOC
21:44
Lesson
83
PDA to CFG Conversion || equivalence of CFG and PDA || TOC
31:05
Lesson
84
Turing Machine for a^n b^n || TOC || Automata Theory
24:55
Lesson
85
Turing Machine for L= a^n b^n c^n || TOC
17:36
Lesson
86
Turing Machine for Regular Language || GATECSE || TOC
17:35
Lesson
87
Turing Machine for ww^r | Turing Machine for Even Palindrome | GATECSE | TOC
21:21
Lesson
88
Turing Machine for Odd Palindrome | waw^r | wbw^r | GATECSE | TOC
14:29
Lesson
89
Turing Machine for wcw | L= wcw | w belongs to (a,b)* | GATECSE | TOC
19:33
Lesson
90
Turing Machine for 1's complement | 2's complement | Turing Machine | Turing Machine as a Transducer
12:24
Lesson
91
Turing Machine for addition of two numbers || GATECSE || TOC
8:39
Lesson
92
Turing Machine For Multiplication|TM for Multiply of two Number|Unary|Turing Machine| GATECSE | TOC
22:09
Lesson
93
Turing Machine as a Comparator | How Turing Machine do Comparison | GATECSE | TOC
17:21
Lesson
94
Turing Machine for Subtraction of two Number | Turing Machine | GATECSE | TOC
14:29
Lesson
95
Introduction to Turing Machine | Formal Definition of Turing Machine | Automata Theory
17:04
Lesson
96
Variation of Turing Machine | Turing Machine | Automata Theory
23:12
Lesson
97
Recursive and Recursive Enumerable Languages in Theory of Computation | GATECSE | TOC
8:47
Lesson
98
Church-Turing Thesis in Theory of Computation | Turing Machine | GATECSE | TOC
9:57
Lesson
99
Universal Turing Machine | Binary encoding of turing machine | GATECSE | TOC
13:39
Lesson
100
Introduction to Countability (Countable and Uncountable Sets) | TOC | Automata Theory
10:28
Lesson
101
Countability Example 1 (Set of integers are Countable) | TOC | Automata Theory
7:21
Lesson
102
Countability Example 2 (Set of all rational numbers are Countable) | TOC | Automata Theory
11:27
Lesson
103
Countability Example 3 (set of all strings over sigma are countable) | TOC | Automata Theory
10:52
Lesson
104
Countability Example 4 (set of all turing machine's are countable) | TOC | Automata Theory
12:11
Lesson
105
Diagonalization Method (set of all languages are uncountable) | Countability | TOC | Automata Theory
18:17
Lesson
106
Operation on countable set (Union and Cartesian product ) | TOC | Automata Theory
20:24
Lesson
107
Closure Properties of Regular Language | GATECSE | TOC
13:13
Lesson
108
Reversal of Regular Language | Closure Properties of Regular Language | GATECSE | TOC
7:17
Lesson
109
Homomorphism in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC
6:08
Lesson
110
Inverse Homomorphism in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC
12:11
Lesson
111
Substitution in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC
3:04
Lesson
112
INIT Operation in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC
7:09
Lesson
113
Quotient Operation in Regular Languages | Closure Properties of Regular Language | GATECSE | TOC
7:21
Lesson
114
Infinite Union and Subset in Regular Languages | Closure Properties of Regular Language | TOC
4:54
Lesson
115
Closure Properties of Context Free Language | Union | Concatenation | GATECSE | TOC
7:41
Lesson
116
Closure Properties of Context Free Language | Intersection | Complementation | GATECSE | TOC
6:31
Lesson
117
Decidable and Undecidable Problem | Undecidability | GATECSE | TOC
23:05
Lesson
118
Rice’s Theorem | Undecidability Problem | GATECSE | TOC
16:52
Lesson
119
Rice’s Theorem Practice Problems | Undecidability Problem | GATECSE | TOC
14:59
Lesson
120
Rice’s Theorem Practice Problems | Undecidability Problem | GATECSE | TOC
12:11
Lesson

Theory of Computation

Set Your Goal

Study Plan Timeline

Target Audience

Prerequisites

Learning Outcomes

Complete Lecture Curriculum (120 Lectures)

Why Learn on SyncStudy Instead of Regular YouTube?

Zero Distractions

Timestamped Notes

Progress Tracking

AI Doubt Support

Related GATE Courses

Aptitude for GATE — Complete Playlist

Digital Electronics

Chai aur Computer Network

Frequently Asked Questions

Ready to finish Theory of Computation?