Complete TOC Theory Of Computation in One Shot (6 Hours) | In Hindi

TOC in one shot

Topics👇
0:00 Introduction
17:50 Finite Automata
02:30:30 Regular Expressions
03:51:12 Grammer
04:35:09 Push down Automata
05:11:19 Turing Machine
05:53:00 Decidability and Undecidability

[AC-qixz]

This is Best Channel for Engineering subjects preparation!!! Hatss of to your dedication!!! Thank You so much Sir!!!!

[SY__JSR]

Thank you so much Sir ... really helpful content for a quick revision covering all concepts

[umarjaved]

00:01 Complete overview of Theory of Computation in one video
01:59 Introduction to basic units in Theory of Computation
05:37 Understanding string formation and language composition in TOC
07:50 Understanding the basic nature of automata and language recognition
11:22 Understanding the length of strings and symbolic representations.
13:11 Understanding the concept of Clean Plus in TOC
16:51 Overview of automata language and grammars
18:30 Understanding the five tuples in DFA
21:48 Understanding DFA and string length in TOC
23:26 Understanding the state transitions and string acceptance in TOC
26:33 Transition to Dead State in DFA
28:00 Understanding the transition between states in TOC
31:04 Designing DFA and NFA for given language constraints
32:36 Understanding the principles of transitioning between states
35:42 Discussing the language emergence with strings starting from A or B
37:16 Understanding the string validation process in TOC
40:18 Explaining the final state transition in TOC Theory Of Computation
41:56 Understanding divisibility and reminders in Theory Of Computation.
45:12 Constructing DFA for divisibility by 3
46:57 Creating and understanding transition function for a DFA
49:48 Understanding acceptance and rejection in DFAs
51:24 Understanding Deterministic Finite Automaton (DFA)
54:43 Understanding the concept of input symbols in Theory of Computation.
56:23 Understanding the importance of specific positions in the string
59:29 Explaining state transitions in DFA
1:00:59 Understanding the acceptance of valid strings in TOC
1:04:16 Explains transition of states in TOC
1:06:07 Converting NFA to DFA is easier than creating DFA
1:09:21 Explaining transitions and path possibilities in TOC
1:10:57 The importance of including 'b' in the transition function
1:14:09 Discussing the acceptance of strings in the language
1:15:46 Exploring transition moves in TOC
1:18:50 TOC Theory Of Computation
1:20:19 Explanation of accepting valid strings with combinations of 'a' and 'b'.
1:23:20 DFA has unique states, AFA has multiple options
1:25:06 Understanding DFA and AFA conversion process
1:28:06 Understanding state transitions in DFA
1:29:34 Discussing the final status and transitions in the TOC theory of computation.
1:32:55 Discusses transition function and state transitions in automata
1:34:35 Understanding the basic idea of constructing DFAs
1:38:00 Understanding Computation Without Input
1:39:40 Understanding the asin closure concept
1:42:49 Understanding state transitions in TOC
1:44:32 Understanding transition functions and closure in TOC
1:47:39 Transition function explained with examples
1:49:07 Generating AFA through table
1:52:15 Understanding and applying epsilon closures in TOC
1:53:45 Understanding the generation of new states in DFA
1:56:40 Explanation of self-transitions in TOC theory.
1:58:13 DFA transitions and final state
2:01:23 Understanding the output function and its application in TOC.
2:03:04 Understanding state transitions and outputs in TOC
2:06:10 Transitioning between states based on input symbols
2:07:46 Understanding transition tables and output symbols
2:10:49 State and input relationship in the Theory of Computation
2:12:27 Understanding state transitions and outputs
2:15:45 Understanding transition tables in TOC
2:17:13 Understanding transition table of a machine
2:20:20 Transition from q1 to q2b and creation of new states
2:21:56 Introduction of new state in TOC
2:25:11 Minimizing DFAs is a difficult task
2:26:47 Understanding the concept of unreachable states
2:29:52 Introduction to regular expressions and their use in representing regular languages
2:31:32 Explanation of regular language and regular expressions
2:34:55 Understanding regular expressions and generating expressions for given languages.
2:36:28 Removing 'a' may lead to accepting strings without 'a'
2:39:39 Explaining valid regular expressions
2:41:10 Describing regular expressions and their components
2:44:14 Understanding the concept of at most two in the language
2:45:41 Understanding Regular Expressions for Generation
2:48:58 Regular expression properties overview
2:50:35 Explanation of LHS Equal to RHS Fund
2:53:46 Understanding Regular Expression for TOC
2:55:20 Explanation of reaching final state using a and b options

[ManojVerma-eyqr]

Finally COMPLETED 😃 Amazing to the point content, Thank you so much Sir ❤

[parthclasses]

Best video I have ever watch on TOC . Clarity of concept at next level. Totally student friendly. And the best part is about the way sir teaches, he knows where a student can face doubts . Thanks once again for the free notes 📝. 🙏🙏

[_amitpandey]

Please make one shot video on Deep.learning, machine learning and image processing

[rakeshsingh-zhy]

Complete overview of Theory of Computation in one video
00:01
✦
Introduction to basic units in Theory of Computation
01:59
✦
Understanding string formation and language composition in TOC
05:37
✦
Understanding the basic nature of automata and language recognition
07:50
✦
Understanding the length of strings and symbolic representations.
11:22
✦
Understanding the concept of Clean Plus in TOC
13:11
✦
Overview of automata language and grammars
16:51
✦
Understanding the five tuples in DFA
18:30
✦
Understanding DFA and string length in TOC
21:48
✦
Understanding the state transitions and string acceptance in TOC
23:26
✦
Transition to Dead State in DFA
26:33
✦
Understanding the transition between states in TOC
28:00
✦
Designing DFA and NFA for given language constraints
31:04
✦
Understanding the principles of transitioning between states
32:36
✦
Discussing the language emergence with strings starting from A or B
35:42
✦
Understanding the string validation process in TOC
37:16
✦
Explaining the final state transition in TOC Theory Of Computation
40:18
✦
Understanding divisibility and reminders in Theory Of Computation.
41:56
✦
Constructing DFA for divisibility by 3
45:12
✦
Creating and understanding transition function for a DFA
46:57
✦
Understanding acceptance and rejection in DFAs
49:48
✦
Understanding Deterministic Finite Automaton (DFA)
51:24
✦
Understanding the concept of input symbols in Theory of Computation.
54:43
✦
Understanding the importance of specific positions in the string
56:23
✦
Explaining state transitions in DFA
59:29
✦
Understanding the acceptance of valid strings in TOC
1:00:59
✦
Explains transition of states in TOC
1:04:16
✦
Converting NFA to DFA is easier than creating DFA
1:06:07
✦
Explaining transitions and path possibilities in TOC
1:09:21
✦
The importance of including 'b' in the transition function
1:10:57
✦
Discussing the acceptance of strings in the language
1:14:09
✦
Exploring transition moves in TOC
1:15:46
✦
TOC Theory Of Computation
1:18:50
✦
Explanation of accepting valid strings with combinations of 'a' and 'b'.
1:20:19
✦
DFA has unique states, AFA has multiple options
1:23:20
✦
Understanding DFA and AFA conversion process
1:25:06
✦
Understanding state transitions in DFA
1:28:06
✦
Discussing the final status and transitions in the TOC theory of computation.
1:29:34
✦
Discusses transition function and state transitions in automata
1:32:55
✦
Understanding the basic idea of constructing DFAs
1:34:35
✦
Understanding Computation Without Input
1:38:00
✦
Understanding the asin closure concept
1:39:40
✦
Understanding state transitions in TOC
1:42:49
✦
Understanding transition functions and closure in TOC
1:44:32
✦
Transition function explained with examples
1:47:39
✦
Generating AFA through table
1:49:07
✦
Understanding and applying epsilon closures in TOC
1:52:15
✦
Understanding the generation of new states in DFA
1:53:45
✦
Explanation of self-transitions in TOC theory.
1:56:40
✦
DFA transitions and final state
1:58:13
✦
Understanding the output function and its application in TOC.
2:01:23
✦
Understanding state transitions and outputs in TOC
2:03:04
✦
Transitioning between states based on input symbols
2:06:10
✦
Understanding transition tables and output symbols
2:07:46
✦
State and input relationship in the Theory of Computation
2:10:49
✦
Understanding state transitions and outputs
2:12:27
✦
Understanding transition tables in TOC
2:15:45
✦
Understanding transition table of a machine
2:17:13
✦
Transition from q1 to q2b and creation of new states
2:20:20
✦
Introduction of new state in TOC
2:21:56
✦
Minimizing DFAs is a difficult task
2:25:11
✦
Understanding the concept of unreachable states
2:26:47
✦
Introduction to regular expressions and their use in representing regular languages
2:29:52
✦
Explanation of regular language and regular expressions
2:31:32
✦
Understanding regular expressions and generating expressions for given languages.
2:34:55
✦
Removing 'a' may lead to accepting strings without 'a'
2:36:28
✦
Explaining valid regular expressions
2:39:39
✦
Describing regular expressions and their components
2:41:10
✦
Understanding the concept of at most two in the language
2:44:14
✦
Understanding Regular Expressions for Generation
2:45:41
✦
Regular expression properties overview
2:48:58
✦
Explanation of LHS Equal to RHS Fund
2:50:35
✦
Understanding Regular Expression for TOC
2:53:46

[shashiverma]

The best TOC one shot video on YouTube (Back pakka clear hooga wo bhi acche number se)

Sir zo confidence appke video ko deekh ke aaya hai sayad kisiko deekhke nahi aaya ajj Mera TOC sa paper tha 100 percent nikal jayeega .You are just a masihaaa for one day preparation for engineering paper)

Thanks sir for making such a wonderful content hope one day I will meet you in person🤩

[Shubham_Karne]

Thank you so much sir thanks a lot you are life saver sir thanks a lot for making these awesome contents love from Mumbai sir❤❤❤🎉🎉🎉

[jack_sparrow]

2:24:36 minimizationof finite automata

[KULDEEPGOHEL]

Thank you so much sir for such an amazing content which is helpful for everyone in exam❤

[PritamGhoshal-ucvr]

Thank you so much Sir for such an amazing content❤❤❤❤

[divyajyotiraj]

Thank you sir for the lectures you provide. I gave my automata exam today and it went better than my expectations. I thought I would fail but this saved me. I also gave my oops exam after attending your oops one shot and it went well as well. Now going to cover your coa one shot. Thanks again.

[iankitchy]

Thank you so much sir...this video helped a lot.

[harshsingh]

thank you for this video really love this !!

[anshikajaiswal]

sir please provide the one short video on BIG DATA .eagerly waiting for your reply sir

[guddu]

We need one shot Microprocessor and interfacing sir please!..

[sanatpawar]

Thank you very much for your efforts sir

[shubhampochhali]

Sir aap production rules kaise likhre ho direct cfl to cgf mei? Koi tarika toh explain kijiye

[YatendraJoshi-gs]

thankeww sir for providing a lot of content in just short single video