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

➡ Contact Us: 👇
📞Call on: [phone]

➡ One Shot Complete Playlist for GATE CSE Exam : 👇

➡ Our One Shot Semester Exam Videos: 👇

#knowledgegate #sanchitsir #sanchitjain

*********************************************************
Content in this video:
00:00 (Chapter-0:- About this video)

02:00 Chapter-1 (Basic Concepts and Automata Theory): Introduction to Theory of Computation- Automata, Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, NFA with ε- Transition, Equivalence of NFA’s with and without ε-Transition, Finite Automata with output- Moore Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite Automata.

3:21:38 Chapter-2 (Regular Expressions and Languages): Regular Expressions, Transition Graph, Kleen’s Theorem, Finite Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s Theorem, Regular and Non-Regular Languages- Closure properties of Regular Languages, Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidability- Decision properties, Finite Automata and Regular Languages

4:55:02 Chapter-3 (Regular and Non-Regular Grammars): Context Free Grammar(CFG)-Definition, Derivations, Languages, Derivation Trees and Ambiguity, Regular Grammars-Right Linear and Left Linear grammars, Conversion of FA into CFG and Regular grammar into FA, Simplification of CFG, Normal Forms- Chomsky Normal Form(CNF), Greibach Normal Form (GNF), Chomsky Hierarchy, Programming problems based on the properties of CFGs.

6:26:30 Chapter-4 (Push Down Automata and Properties of Context Free Languages): Nondeterministic Pushdown Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown Automata(DPDA) and Deterministic Context free Languages(DCFL), Pushdown Automata for Context Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown Automata, Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFL, Programming problems based on the properties of CFLs.

Recursive Function Theory.

knowledge gate,knowledge gate sanchit jain,theory of computation,theory of computation for gate cse,theory of computation gate playlist,theory of computation full course,theory of computation important questions,knowledge gate toc,sanchit jain toc,toc one shot,Complete TOC Theory Of Computation in one shot,toc in one video,toc knowledge gate,toc tutorial,toc playlist,toc gate,toc unit 1,toc unit 2,toc unit 3,toc unit 4,toc unit 5

[lavanyasingh]

47:44:00 numerical dfa string
1:13:06 same
1:54:00
2:46:17 more
2:54:00 mealy
3:20:00 minimization
3:35:00 RE
4:01:00 RE from automata
4:19:00 arden
4:40:00 pumping
5:33:00 generate grammar
6:45:49 pda making
7:44:00 turning machnje

[KanishkSaha]

5:13:36 5:38:00

Pattern - 1:29:00
Epsilon NFA - 2:25:00
Arden's Theorem - 4:24:00
CHomsky Heirarchy - 5:18:25
Pumping Lemma - 4:36:35
Grammar - 5:18:25
Derivation Tree - 5:46:40
Ambiguity in Grammar - 5:50:50
Left Right Recursion - 5:58:10 {Same Non-terminal should occur on the left/right handside}
Minimization of CFG - 6:00:00
CNF - 6:15:24

[vibhorjain]

bahut accha padhate he sir aap..all the subjects..love you

[greatpersonality]

At 4:22:23 on C the self loop is for b only but not for a I think the C equation could be C = B.a + C.b

[tejas_machchhar]

Reason to watch one shot series instead of small small videos: "No distraction!"

[SanjeevKumar-musm]

Sir plz make Artificial intelligence one shot with these topicsModule 1 Lecture 10 hrs.

Introduction: Overview, Turing test, Intelligent agents. Problem Solving: Solving Problems by
Searching: Uninformed search - Depth First Search, Breadth First Search, DFID, Heuristic search -
Generate and Test, Best First Search, Beam Search, Hill Climbing, A*, Problem reduction search –
AND/OR Graphs, AO*, Constraint satisfaction, Means-ends analysis, Stochastic search methods -
Simulated Annealing, Particle Swarm Optimization, Game Playing - Minimax algorithm, Alpha-
beta pruning

Knowledge and Reasoning: Building a knowledge base - Propositional logic, first order logic,
Inference in first order logic, Resolution – refutation proofs, Theorem Proving in First Order Logic;
Planning, partial order planning, Uncertain Knowledge and Reasoning, Probabilities, Bayesian
Networks



Learning: Overview of different forms of learning: unsupervised, supervised, semi-supervised, K-
means clustering algorithm, Decision Trees, Neural Networks, Deep Learning.


Advanced topics: Introduction to Computer Vision, Natural Language Processing, Expert Systems,
Robotics, Genetic Algorithm,

[chiranjeevguides]

Timestamps
47:44:00 DFA Numerical
1:13:06 DFA Designing
1:54:00 NFA Designing
2:05:35 NFA to DFA
2:19:28 NFA with Epsilon
2:35:57 Moore
2:46:41 Mealy
2:52:57 Moore to Mealy
2:56:52 Mealy to Moore
3:01:00 Minimization of DFA
3:20:00 minimization
3:22:00 RE
3:32:00 RE Designing
4:01:00 FA to RE
4:11:00 RE to FA
4:19:00 arden
4:40:00 pumping
5:33:00 generate grammar
6:45:49 pda making
7:44:00 turning machnje

[ManishKumar-pbgu]

i follow your previous course total 111 video, now it good to hear that you helping the students free and quality education

[vasubhut]

6:14:40 there is a unique production in B->d (after removing aC)

[qaislatif]

I am watching this video from Germany. However, they focus more on Moore and Mealy machines here. It would be great if you provided more examples for them, but it's still an amazing course. Since you explained DFA thoroughly, Moore and Mealy machines shouldn't be a problem.

[roohifarista]

thank you thank you so much sir it's a great video u can make any subject interesting because you are also an automata of teaching any subject wonderfully and amazing

[abidshah]

Thank You Sir, this video helped me alot for clearning my doubts and understanding the concepts very well.

[ArhamAamir-neqy]

AKTU University wale like kare same syllabus ha 👍❤

[kartikShettiwar-rb]

5:56:26 some CFL are called inherently ambigious means there exist no unambigious CFG to generate the corresponding CFL .
- Rohit Parikh (1961)

[shivashankarec]

35:51 Dfa
1:46:37 Ndfa
2:06:05 Ndfa problem
2:20:00 Nfa with epsilon
3:21:47 Chapter 2 begins
4:34:23 pumping lemma
3:51:22 algebraic properties of regular expression
3:57:04 conversion of FA into Redular expression
4:33:51 Pumping lenma
5:06:30 formal Grammar problems
5:45:58 Derivations
5:50:47 Ambiguity

[akshayanilkawale]

Thank you sir for this amazing one shot video. It cleared all my doubts 😊
Providing this type of quality of education for free is not an easy task I highly appreciate ur efforts and admire it.
Thanks again ❤

[dahiya]

Phenomenal, simplest and clearest explanation i would say

[JehangirKhan-cd]

Dear Sir
software project management is very important subject .your help will great for all of us.

[ChandanJindal-lb]

4:02:02 Sir, won't that be (ab*c)* as a(b+ca)*c is not accepting null String which should be accepted
Btw thanks for such an amazing lecture, really great work.

edit: you told about it at 4:04:00 but still the other once can't accept null right?

[LordSarcasticVlogger]

VERY NICE EXPLANATION SIR...THANKS A LOT...