Sign in to confirm you’re not a bot
This helps protect our community. Learn more

YouTube is not currently available on this device.

YouTube Viewers
12.1M subscribers
<__slot-el>
<__slot-el>
7 years ago
To learn more, please visit the YouTube Help Center:    / help   ...more
...more
Comments are turned off. Learn more
YouTube is not currently available on this device.
N/ALikes
2017Sep 12
To learn more, please visit the YouTube Help Center:    / help  

YouTube Viewers

12.1M subscribers

1.3 TOC | AUTOMATA THEORY (Complete Playlist)
▶

Complete TOC Theory of Computation in one shot | Semester Exam | Hindi

KnowledgeGATE by Sanchit Sir
2

Theory of Computation | TOC in one shot | Complete GATE Course | Hindi #withsanchitsir

KnowledgeGATE by Sanchit Sir
3

GATE 2026 CSE Batch Lauch | 2 Feb, 2025 | 8:00pm | #knowledgegate #withsanchitsir

KnowledgeGATE by Sanchit Sir
4

1.1 Introduction to TOC | Theory of Computation | Automata Theory in Hindi

KnowledgeGATE by Sanchit Sir
5

1.2 What is Symbol, Alphabet, String and Language ? | Theory of Computation | Autoamata Theory

KnowledgeGATE by Sanchit Sir
6

1.3 Length, Concatenation, Reverse, Null, Substring, Prefix, Suffix on Strings | TOC Lecture

KnowledgeGATE by Sanchit Sir
7

1.4 What is Kleene Closure ∑* and Positive Closure ∑+ | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
8

1.5 Basics of Theory Of Computation | Previous Year Questions of GATE, UGC-NET | TOC GATE PYQs

KnowledgeGATE by Sanchit Sir
9

2.1 Marks Distibution of Theory of Computation | TOC | Automata Theory

KnowledgeGATE by Sanchit Sir
10

2.2 How to Design Deterministic Finite Automata (DFA) | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
11

2.3 Deterministic Finite Automata in Detail | What is DFA? | Theory of Computation

KnowledgeGATE by Sanchit Sir
12

2.4 Deterministic Finite Automata | DFA | TOC| | Regular Language | Automata Theory

KnowledgeGATE by Sanchit Sir
13

2.5 Strings in Deterministic Finite Automata | DFA | TOC | AUTOMATA THEORY

KnowledgeGATE by Sanchit Sir
14

2.6 string ending with a substring w | TOC | DETERMINISTIC FINITE AUTOMATA | DFA CONSTRUCTION

KnowledgeGATE by Sanchit Sir
15

2.7 String containing a substring "w" | TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
16

2.8 String containing a substring "w" | DFA | TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
17

2.9 Deterministic Finite Automata - DFA Questions | DFA GATE PYQs | Theory of Computation

KnowledgeGATE by Sanchit Sir
18

2.10 Every string must start and ends with "a" | TOC | DFA Designing | Theory of Computation

KnowledgeGATE by Sanchit Sir
19

2.11 Every string must start and ends with same symbol | TOC | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
20

2.12 Every string must start with either 'aa' or 'bb' | TOC | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
21

2.13 Every string must ends with either 'aa' or 'bb' | TOC | Theory Of Computation | Automata

KnowledgeGATE by Sanchit Sir
22

2.14 Every string must contain with either 'aa' or 'bb' | TOC | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
23

2.15 Every string must be like |w|=2 | TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
24

2.16 Every string must be like |w|=2 | TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
25

2.17 Every string must be like |w|=2 such that |w|= r (mod n ) | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
26

2.18 Every string must be like |w|x=r(mod n) | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
27

2.19 Important GATE PYQs | Deterministic Finite Automata DFA | Theory of Computation

KnowledgeGATE by Sanchit Sir
28

2.20 Every string containing odd number of occurrence of substring 'ab' | Theory of Computation

KnowledgeGATE by Sanchit Sir
29

2.21 How many different DFA can be designed for 2 states | TOC | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
30

2.22 How many different DFA can be designed for 2 states and they accept universal languages? | TOC

KnowledgeGATE by Sanchit Sir
31

2.23 How many different DFA can be designed for 2 states and they accept empty languages? | Auotmata

KnowledgeGATE by Sanchit Sir
32

2.24 Designing a DFA for string Starting with sub string and having length in mod pattern | TOC

KnowledgeGATE by Sanchit Sir
33

2.25 DFA Designing - Nth Symbol from Left/Right End is Always 'x' | Theory Of Computation

KnowledgeGATE by Sanchit Sir
34

2.26 DFA Designing - No. of a=n(mod m) && No. of b=p(mod r) | Theory of Computation

KnowledgeGATE by Sanchit Sir
35

2.27 Problem Solving - DFA Questions | GATE, NET PYQs | Theory of Computation

KnowledgeGATE by Sanchit Sir
36

Complement of DFA | Deterministic Finite Automaton (DFA) | Theory of Computation

KnowledgeGATE by Sanchit Sir
37

2.29 Important GATE - NET Questions | Deterministic Finite Automata (DFA) | Theory of Computation

KnowledgeGATE by Sanchit Sir
38

2.30 Minimization Of Finite Automata With Examples | Dead Equal Unreachable States | Automata Theory

KnowledgeGATE by Sanchit Sir
39

2.31 Practice Question and Examples on Minimization Of Finite Automata | Theory of Computation

KnowledgeGATE by Sanchit Sir
40

3.1 Formal Definition Of NFA In HINDI | Non Deterministic Finite Automata | TOC | AUTOMATA

KnowledgeGATE by Sanchit Sir
41

3.2 Language accepted by Non Deterministic Finite Automata NFA In HINDI | | TOC | AUTOMATA

KnowledgeGATE by Sanchit Sir
42

3.3 Designing of Non Deterministic Finite Automata NFA In HINDI | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
43

3.4 Designing of Non Deterministic Finite Automata NFA In HINDI | Theory of Computation | AUTOMATA

KnowledgeGATE by Sanchit Sir
44

3.5 Designing of Non Deterministic Finite Automata NFA | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
45

3.6 Designing of Non Deterministic Finite Automata NFA | Theory of Computation | TOC | Automata

KnowledgeGATE by Sanchit Sir
46

3.7 Designing of Non Deterministic Finite Automata NFA |Theory of Computation TOC | Automata Theory

KnowledgeGATE by Sanchit Sir
47

3.8 Designing of NFA Questions | Starts and Ends with Different Symbol | Theory of Computation

KnowledgeGATE by Sanchit Sir
48

3.9 Designing of NFA Questions | Accept a String with Specific Length | Theory of Computation

KnowledgeGATE by Sanchit Sir
49

3.10 Important GATE - NET Questions | Non-Deterministic Finite Automata(NFA) | Theory of Computation

KnowledgeGATE by Sanchit Sir
50

3.11 NFA to DFA Conversion | Convert NFA to DFA | Subset Construction | Theory of Computation

KnowledgeGATE by Sanchit Sir
51

3.12 Previous Year Problem for NFA to DFA Conversion In HINDI | Practice question for NFA to DFA

KnowledgeGATE by Sanchit Sir
52

3.13 Practice Problem for NFA to DFA Conversion In Hindi | Practice question for NFA to DFA | TOC

KnowledgeGATE by Sanchit Sir
53

3.14 Epsilon NFA in Hindi | NFA with Epsilon transition | Null Transitions | Theory of Computation

KnowledgeGATE by Sanchit Sir
54

3.15 Practice question on Epsilon NFA to NFA conversion | Convert Epsilon NFA to NFA | Automata TOC

KnowledgeGATE by Sanchit Sir
55

3.16 Practice question on Epsilon NFA to NFA conversion | Convert Epsilon NFA to NFA | TOC Automata

KnowledgeGATE by Sanchit Sir
56

4.1 How to identify Regular Language? | Testing whether a language is regular or not! | TOC Automata

KnowledgeGATE by Sanchit Sir
57

4.2 How to identify Regular Language? | Example of Regular Language | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
58

4.3 How to identify Regular Language? | Difference between Regular and Non Regular Language | TOC

KnowledgeGATE by Sanchit Sir
59

4.4 How to identify Regular Language? | Practice problem on Regular Language Identification | TOC

KnowledgeGATE by Sanchit Sir
60

4.5 Problem Solving on Regular Language Identification | PYQs for Regular Language Identification

KnowledgeGATE by Sanchit Sir
61

4.6 Problems on Regular Language Identification | GATE Questions- Regular Language Identification

KnowledgeGATE by Sanchit Sir
62

5.1 Regular Expressions | Regular Language in Automata | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
63

5.2 Regular Expressions in TOC in HINDI | Find language from a given regular expression

KnowledgeGATE by Sanchit Sir
64

5.3 Regular Expressions in TOC in HINDI | Designing Regular Expression | TOC | Theory of Computation

KnowledgeGATE by Sanchit Sir
65

5.4 Important Formula and Operations in Regular Expressions | Regular Expressions | TOC Automata

KnowledgeGATE by Sanchit Sir
66

5.5 How to design or write Regular Expression for Regular Language? | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
67

5.6 Design or Write Regular Expression for Regular Language in Hindi | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
68

5.7 PYQs on Regular Expression | Regular Expressions - Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
69

5.8 Important GATE - NET Questions | Regular Expressions - Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
70

5.9 Conversion of Finite Automata to Regular Expression | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
71

5.10 Convert of Finite Automata to Regular Expression | Theory Of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
72

5.11 Convert Finite Automata to Regular Expression | How to convert FA to Regular Expression?

KnowledgeGATE by Sanchit Sir
73

5.12 Important GATE Questions | Converting Finite Automata to Regular Expression | Automata Theory

KnowledgeGATE by Sanchit Sir
74

5.13 Conversion Regular Expression to Finite Automata | Regular Expressions to NFA | TOC

KnowledgeGATE by Sanchit Sir
75

5.14 Regular Expression to NFA Conversion | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
76

5.15 Important PYQs on Regular Expressions to Finite Automata | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
77

5.16 GATE Questions on Regular Expressions to Finite Automata | Theory of Computation | Automata

KnowledgeGATE by Sanchit Sir
78

6.1 Basics of Grammar | Language generated by Grammar | String generated by Grammar

KnowledgeGATE by Sanchit Sir
79

6.2 Formal definition of Grammar | Tuples of a grammar| Grammar language generator

KnowledgeGATE by Sanchit Sir
80

6.3 Chomsky Hierarchy | Identification of Grammar | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
81

6.4 Type 0 Grammar | Recursive enumerable grammar | Phase structured Grammar | Unrestricted Grammar

KnowledgeGATE by Sanchit Sir
82

6.5 Type 1 Grammar | Context Sensitive Grammar | Length Increasing Grammar | Chomsky Classification

KnowledgeGATE by Sanchit Sir
83

6.6 Type 2 Grammar | Context free grammar | Chomsky classification of grammar | Automata Theory

KnowledgeGATE by Sanchit Sir
84

6.7 Type 3 Grammar | TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
85

6.8 Problem Solving on Regular Grammar | Important PYQs on Regular Grammar | Theory of Computation

KnowledgeGATE by Sanchit Sir
86

6.9 GATE - NET Questions on Regular Grammar | Problems on Regular Grammar | Theory of Computation

KnowledgeGATE by Sanchit Sir
87

6.10 Regular Grammar to Regular Expression Conversion Directly | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
88

6.11 Regular Grammar to Finite Automata Conversion Directly | Theory of Computation | Automata | TOC

KnowledgeGATE by Sanchit Sir
89

6.12 Finite Automata to Regular Grammar Directly | Theory Of Computation | Automata Theory | TOC

KnowledgeGATE by Sanchit Sir
90

7.1 NP Completeness | Complexity Theory | TOC | Theory Of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
91

7.2 Decidable | Undecidable | Complexity Theory | NP Completeness | TOC | THEORY OF COMPUTATION

KnowledgeGATE by Sanchit Sir
92

7.3 Decision Properties for Regular Languages | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
93

7.4 Closure Properties of Regular Languages | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
94

7.5 Problem Solving of Decision Properties & Closure Properties of Regular Languages | TOC

KnowledgeGATE by Sanchit Sir
95

8.1 Moore Machine Complete Discussion | Everything about Moore Machine | Theory of Computation TOC

KnowledgeGATE by Sanchit Sir
96

8.2 Mealy Machine Complete Discussion | Everything about Mealy Machine | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
97

8.3 Mealy Vs Moore Machine Comparison | Difference between Mealy and Moore | Theory of Computation

KnowledgeGATE by Sanchit Sir
98

8.4 Problem Solving on Mealy & Moore Machine | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
99

9.1 Context Free Language | Context Free Grammar and Pushdown Automata | CFG

KnowledgeGATE by Sanchit Sir
100

9.2 Pushdown Automata PDA | Pushdown Automata explained in Detail | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
101

9.3 Push, Pop, Skip Operations on Pushdown Automata | TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
102

9.4 a^n b^n example | Pushdown Automata | Design PDA in Theory Of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
103

9.5 a^n b^2n example | Pushdown Automata | PDA in Theory of Computation | Automata Theory in Hindi

KnowledgeGATE by Sanchit Sir
104

9.6 WCWr example in Pushdown Automata | Theory Of Computation | Automata Theory | TOC

KnowledgeGATE by Sanchit Sir
105

9.7 Problem Solving on Pushdown Automata | Theory of Computation | TOC

KnowledgeGATE by Sanchit Sir
106

13.1 Basics of Turing Machine | Theory of Computation | Automata Theory | TOC

KnowledgeGATE by Sanchit Sir
107

13.2 Turing Machine for a^n b^n | Turing Machine in TOC | Theory of Computation | Automata Theory

KnowledgeGATE by Sanchit Sir
108

13.3 Turing Machine for a^n b^n c^n in Hindi | Turning machine as Language Acceptor | TOC Automata

KnowledgeGATE by Sanchit Sir
109

13.4 Turing Machine for WCW in hindi | Turning machine as language acceptor | Theory of Computation

KnowledgeGATE by Sanchit Sir
110

13.5 Turing Machine as adder | Turing machine as Transducer| Binary Addition | Automata Theory

KnowledgeGATE by Sanchit Sir
111

13.6 Turing Machine as unary to binary converter | truing machine as transducer

KnowledgeGATE by Sanchit Sir
112

13.7 Turing machine for 2's complement in hindi | Turing machine as Transducer | Automata Theory

KnowledgeGATE by Sanchit Sir
113

13.8 L={wcw | w ε {a,b}*} Turing machine in hindi | Turing machine as transducer | Automata Theory

KnowledgeGATE by Sanchit Sir
114

13.9 Power of Turing Machine in hindi | Language accepting power of Turing Machine | Automata | TOC

KnowledgeGATE by Sanchit Sir