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
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 📝. 🙏🙏
The best TOC one shot video on TH-cam (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🤩
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.
Current state and next state 2:08:51 Q0 to q0 -> Input 0 dekha or output a 2:10:11 moore mc output depends on present state 2:10:11 meely mc me output depends on p.s and pre lnput . 2:10:32 interchange point no.3 2:12:26 Input/ output symbols= 0,1 2:13:41 embedded ouptut of the next state.. ko T.line me likhana in meely mc 2:18:23 moore t.t to meely t.t conversion If we go q0 to q1 then refer karo q1 ka output of moore mc 2:24:45 minimize: min no. Of State
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
Note : 52:01 compliment question -> dfa structure same but , non final state ko final state bana do or vice versa. Nfa 1:10:09 any possibility/ move that string is valid in that particular language (nfa) 1:13:05 jab loops aagaya matlab I/p can be anytime 0,1,2,3,4...... 1:23:24 on seeing the same input you are going to 2 different states 1:30:13 nfa to dfa conv.. nhi samaj aaya 1:38:06 enfa me kuch na dekhe hu bhi next state pe na pa raha hu 1:41:04 elison closer: elison move le kar kin kin state tak pahuch sakte ho. 1:46:33 for understanding..... 1:50:59 ye topic samaj me nhi aaya 1:58:58 not understand..
Alhamdulillah,Sir paper dekar hi aa rha hu and me pass hu that's all matters sirf mostly sirf apki and some gate smashers video dekhi wo bhi exam ke 2-3din phele start kia study Krna but thanks to you I'm gonna pass inshaallah
Thanks you so much sir ye bohot hi zada helpfull raha mere liye mene chanel subsceibe or vedio like kardiya meri help karne keliye bohot bohot shukriya May Allah bless you
Sir 1:13:35 pr 'bab' lekar aana hai string me to usme saari possibilities nhi aa rahi hai jese 'abaaa(bab)aba' yaha par bab se pehle agar kisi string me baa hai to voh string is nfa me include nhi ho rhi
4:14:54 sir all good but can you please tell ki jo production rules aapne create kare hai unhe.. jaldi create kare kese means how we can assure that what production rules we generate woh right hai ya nahi....Aapne bataya ki every type as different different restrictions to generate production rules that's right i understood but examples mein production rules jaldi kese banaye ya koi trick hoto bataye kyun uske baad ka traversing aajata hai but ek efficient production rules hote hai example keliye voh banane mein dikkat horahi hai aur jyada time bhi ja raha hai!
3:15:39 neeche main bbb ke lie jo aapne banaya hai , wo bb par satisfy nahi ho raha hai , agar process neeche jaayega to bb par to accept hin nahi hoga
Sir aapne minimization of DFA galat karaya hai usme toh union nahi lete pie wale tarike se nikale hai sir aapne padaya toh accha hai but jaise 1 chapter me aapne ya Alag Saha Kara diya kahi bakiyo me to esa nahi karaya to wahi soch rha hu ki aage video dekhu ki nahi. I m not your hater sir just want to tell you this
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
shukriya
u are legend
Thanks Bro
useless
sukriya
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 📝. 🙏🙏
Is this for aktu exam also?
@@dhruvjain9599haan bhai
@@dhruvjain9599 yes go for it
This is Best Channel for Engineering subjects preparation!!! Hatss of to your dedication!!! Thank You so much Sir!!!!
Finally COMPLETED 😃 Amazing to the point content, Thank you so much Sir ❤
Best video. understands everything even watching it on 2x
Please make one shot video on Deep.learning , machine learning and image processing
The best TOC one shot video on TH-cam (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🤩
Theory of automata and formal languages same h na
Yes@@diwakarrana7178
@@diwakarrana7178ha
Eagerly waiting for COA and CN.
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.
Thank you so much Sir ... really helpful content for a quick revision covering all concepts
Hatts off to your dedication sir , very helpfull ...thankyou so much 🙏🙏
Current state and next state 2:08:51
Q0 to q0 -> Input 0 dekha or output a
2:10:11 moore mc output depends on present state
2:10:11 meely mc me output depends on p.s and pre lnput .
2:10:32 interchange point no.3
2:12:26 Input/ output symbols= 0,1
2:13:41 embedded ouptut of the next state.. ko T.line me likhana in meely mc
2:18:23 moore t.t to meely t.t conversion
If we go q0 to q1 then refer karo q1 ka output of moore mc
2:24:45 minimize: min no. Of State
Next video Computer Network please 🥺🙏
teri bhi back hai kya bhaii
@@harshsaratkar687sab log back nhi hota regular bin hota
Bc 10 ghante ki bnadi
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
King
Power of Merlin AI 😂😂
Watching this one shot video and feeling like TOC is nothing in which way you are teaching .Great job on it 🙏🙏
Very Good Lecture sir Very useful for our university EXAM this lecture haves the all content Thank You Sir ♥ !!!
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❤❤❤🎉🎉🎉
2:24:36 minimizationof finite automata
PURA VIDEO LG RHA H ULTA DEKH RHA HU , lgta h ek baar dekh ke wapas se dekna pade ga
Thank u very very much Sir, for all efforts and grate explenation , and realy sir this video is to helpfull me , thank you so much sir by heart❤❤❤❤❤❤
Thank you so much Sir for such an amazing content❤❤❤❤
Great explanation, Thankyou Sir.
Successfully completed TOC thanks!
Note :
52:01 compliment question
-> dfa structure same but , non final state ko final state bana do or vice versa.
Nfa
1:10:09 any possibility/ move that string is valid in that particular language (nfa)
1:13:05 jab loops aagaya matlab I/p can be anytime 0,1,2,3,4......
1:23:24 on seeing the same input you are going to 2 different states
1:30:13 nfa to dfa conv.. nhi samaj aaya
1:38:06 enfa me kuch na dekhe hu bhi next state pe na pa raha hu
1:41:04 elison closer: elison move le kar kin kin state tak pahuch sakte ho.
1:46:33 for understanding.....
1:50:59 ye topic samaj me nhi aaya
1:58:58 not understand..
Thank you so much sir for such an amazing content which is helpful for everyone in exam❤
Awesome lecture sir thank a lot sir ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤
Awesome video sir. Thanks a lot .......
Alhamdulillah,Sir paper dekar hi aa rha hu and me pass hu that's all matters sirf mostly sirf apki and some gate smashers video dekhi wo bhi exam ke 2-3din phele start kia study Krna but thanks to you I'm gonna pass inshaallah
Thank you so much sir , you taught very fantastic sir 😊
thank you sir , this one short was enough for me to revise the concepts
Thanks you so much sir ye bohot hi zada helpfull raha mere liye mene chanel subsceibe or vedio like kardiya meri help karne keliye bohot bohot shukriya May Allah bless you
Sir 1:13:35 pr 'bab' lekar aana hai string me to usme saari possibilities nhi aa rahi hai jese 'abaaa(bab)aba' yaha par bab se pehle agar kisi string me baa hai to voh string is nfa me include nhi ho rhi
thankx sir for saving our life
Sir mai aapko❤❤❤❤ se Thankyou hi bol skta hoon bass....
God bless you sir!!
Thank you so much sir...this video helped a lot.
1:23:30 NFA , DFA
sir im getting passed in exams just because of you sir you are just so amazing thankyou somuch fir this video❤❤
best teacher for TAFL
according to aktu syllabus ??
@@future3999 topics are same same
5 min engineering becomes 5 hours+ engineering 😅😅
4:14:54 sir all good but can you please tell ki jo production rules aapne create kare hai unhe.. jaldi create kare kese means how we can assure that what production rules we generate woh right hai ya nahi....Aapne bataya ki every type as different different restrictions to generate production rules that's right i understood but examples mein production rules jaldi kese banaye ya koi trick hoto bataye kyun uske baad ka traversing aajata hai but ek efficient production rules hote hai example keliye voh banane mein dikkat horahi hai aur jyada time bhi ja raha hai!
Thank you very much for your efforts sir
56:30 q2 has self loop so it can have infinite B's right? then how is this figure correct?
Bhai thik hai wo
Isme likha hai 2nd from left means 2nd symbol must be 'a' after that any symbol comes, we don't care
What a explanation....
Thank you thank you very much 😊🙏🏻
thank you for this video really love this !!
03:01:55 mistake (b+ a.b*.a.b*)* this will be the right answer
Thank you so much bhaiya..............
great thanks sir !
best teacher
Tq sir for your efforts 🫡
❤❤❤ Maza aa gyaa sir jiii
thankeww sir for providing a lot of content in just short single video
We need one shot Microprocessor and interfacing sir please!..
Thank you bhaiya ❤
46:21 soo for number 4 sequence will ne q0 q1 q2 q3
Very nice and thank you sir
3:15:39 neeche main bbb ke lie jo aapne banaya hai , wo bb par satisfy nahi ho raha hai , agar process neeche jaayega to bb par to accept hin nahi hoga
My TOC exam was yesterday and I didn't do well. Now that you are making this video, how should I react?
Mine is tomorrow and this subject is the most useless one i have ever encountered in my life after "software engineering" subject
Be stoic bro. Life does throw stones sometimes.
This is not only the video in the TH-cam ig😭
THANK YOU SIR 🙏
❤❤❤ pass hoo gaya sir 😂😂😂
thank you so much sir, you have my respect
Hi. Is this video really helpful and contains all the topics? I've my exam the day after, n I can't waste my time if this video is not worth it.
@@radhishukla Yess it covers all topics , all the topics and I'd suggest you to give more time for practicing , I had my exam and it went really well
@@MayurJaiswal11 Okayyyy Thanks Alottttttt!!
@@radhishukla and one more thing, it's like whole nfa dfa module ek taraf and rest of the toc ek taraf
@@MayurJaiswal11 matlab
Thank you sir❤
12 hr baad mera exam hai aur mein abhi yeh one shot dekh rha hum 😅😅
RTU exam 😢
Bhai 25 ko hai exam
@@mkrahul8385 yess 25 ko L lagne Wale h 🥲
@@mkrahul8385 mera 24th ko hi hai
Me too😂😂
u did the best job sir
best
thank you so much sir
this video is cheat code for us
sir please provide the one short video on BIG DATA .eagerly waiting for your reply sir
Thanks a lot sir 🙂
Automata formal and theory ke liye ye hai kyaaa??
Thank you sm!!
सर एक पूरा embedded software पे course निकालो क्योंकि हर जगह CSE वालों की बात होती है core की तरफ़ कोई ध्यान नहीं देता
Best Ever video and notes for TOC
regular expression me star kabhi b per kabhi a per that was little confusing thing can you plz explain me where we have to use star
doing such a great work keep doing god bless you
2:10:11 moore vs mealy
nfa- 1:06:10 - 1:20:20
Thank you sir
thankyou❤❤
Video was amazing thank u sir for easy way explaination thanks alot sir
the most understandable video sir
Nice one sir
Shukriya
Sir Start and ends with same symbol mein Epsilon bhi hoga ?
Best
Very helpful
Thanks
sir, is tafl and toc same ?
sir is this sufficient for all the concepts needed for GATE exam?? and thank you for such selfless service.. may god bless u and ur loved ones
Is this theory of automata and formal languages?
Yes
Tysm ❤❤❤❤❤❤
sir on 1:14:54 what if the string is baababa
Today is my exam . I have watched two time this video
5 minute engineering bol kr 6hrs pda diya 😂
Sir ye dead states ka kya fanda haii?
Sir aap production rules kaise likhre ho direct cfl to cgf mei? Koi tarika toh explain kijiye
is this for aktu btech 4th sem
Moore 2:00:00
Please provide DCN Ans MALP one shot as per syllabus
is this for GATE or Engineering exams only?(RGPV etc) because I don't wanna learn additional concepts and just want to pass in RGPV exam
2:55:00 convert FA to RE
Thank you for this sir but if possible can you make a one shot for cloud, data mining and warehouse , Network security as well thank you sir
Sir very very very thank you
Sir aapne minimization of DFA galat karaya hai usme toh union nahi lete pie wale tarike se nikale hai sir aapne padaya toh accha hai but jaise 1 chapter me aapne ya Alag Saha Kara diya kahi bakiyo me to esa nahi karaya to wahi soch rha hu ki aage video dekhu ki nahi. I m not your hater sir just want to tell you this
So you have watched the full video? How was it ? Should I study from it or go for another video?
@@AdarshSingh-ec2ch this is good upto 1st and 2nd chapters and for others i dont't recommend this
@@developerUtkarshok , thanks
@@developerUtkarsh Bhai 1st and 2nd chapters konse aur baaki ka tumne kaha se kiya he
@@BadalJena-oh6qu jo isme hai 1st and 2nd