sometimes examples are worth more than hundreds of pages of theory ...
@monstergamers76873 жыл бұрын
i agree with you my friend
@bjornmartin64803 жыл бұрын
i know it is quite randomly asking but does anybody know of a good site to stream new movies online ?
@tusharpandita167 Жыл бұрын
@@bjornmartin6480 fmovies , soap2day
@rohitalawadhi10 жыл бұрын
thanks : content 10/10 ; explanation 10/10;
@ananthr15833 жыл бұрын
Biceps 10/10 😂
@madhivarman5087 жыл бұрын
why College don't teach this method....:( ? This is so much easier..:)..You're really a great teacher
@yanyanliu11012 жыл бұрын
Extremely clear explanation ! Good example! Steady pace. Brilliant video
@naveennayak14218 жыл бұрын
Sir, please upload the lectures on pumping lemma..
@PoolOfPeas10 жыл бұрын
This is a very clear explanation; the theoretical part shed light on the practical example such that I could understand not only how to do it but also why it works. Thanks.
@tinabijlani67857 жыл бұрын
superbb explanation !!! worth the concept !! i study whole tcs syllabus from your channel v v sensible.
@SaumyaSharma0073 жыл бұрын
Best teacher award goes to you Sir 🌟👌
@PrajyotMeshram5 жыл бұрын
This was so amazingly explained! Teachers should actually watch your videos and try to put in some efforts to explain like you do!
@harshalbhoir12625 жыл бұрын
Merko bhi sikha de bhai colg me
@PrajyotMeshram5 жыл бұрын
@@harshalbhoir1262 Haha chal saale sab aatay tujhe
@FoigTCG8 жыл бұрын
screw the table filling algorithm, this method is so much easier
@aplutaplut1764 жыл бұрын
Bautista is here ! Boom Boom Boom Boom
@dr.md.atiqurrahman27483 жыл бұрын
Just Wow!!!!!!!!!!!!! Is it possible to give an explanation better than this? I don't know. If possible, I will be then really amazed.
@plinplinplonplinplonplin6 жыл бұрын
Can you explain why q0 and q2 are 3 equivalent with q1 not being a part of 2 equivalence?
@spamspam57416 жыл бұрын
Yes, q1 and q1 are in the same state (as you can see) and q2 and q2 as well, basically, there's no problem if both go to same state, as the state will always be contained in itself. It only causes problem, when it is going to 2 different states, and those states lie in different equivalence during previous stage
@Digital_Sansaar5 жыл бұрын
Sir your teaching style is definitely unique
@vijayahemabadana14455 жыл бұрын
superb explanation sir.your explanation is very peaceful to hearing
@sirajAlam0498 жыл бұрын
chha gaye guru... Kash app hamare college me lecturer hote, :'(
@ashishjindal26777 жыл бұрын
That's great sir. I wasted an hour in understanding this topic through book and that doesn't help me. But your video is great within one example topic is crystal clear to me. Thnx
@rawshn7 жыл бұрын
This video saved my life!
@vaibhavsharma-gc4ce6 жыл бұрын
In the last step, i.e 4th equivalent, it is shown q0 & q2 paired but for q0 & q2 with 'a' going to q1, which is not in same group in 3rd equivalent. So how is it possible??
@faizansiddiqui68626 жыл бұрын
I also wanted to ask this
@ThePositiev3x8 жыл бұрын
How can we talk about "3 equivalent states" while there are only 2 inputs? Also, q2 and q3 both go to q1 with input a. Shoudln't they be 1-equivalent?
@bangvu2127 Жыл бұрын
Thanks for sharing the easier way to solve it. Professors at uni never tell us this
@bikramthapa26876 жыл бұрын
thank u so much sir for giving clear concept in all topics...
@issacnadar3025 жыл бұрын
Sir by listening your lecture we understand the concept more thoroughly .thanks a lot.
@pranavghadge75265 жыл бұрын
why we cant directly draw the minimized DFA by seeing the same states from the table.
@_KuchBhi_5 жыл бұрын
same Q bhai
@gousiyashaik56653 жыл бұрын
Of course bro observe it q4 is the final state so it's going to be separated q0 & q2 are have same states q3 is separated due to final state which is q4 Finally q1 is separated due to q3 That's it 🤠 it's very easy and simple bro U need to separate final States first and then separate every state by seeing it's states directly no need to write equivalents
@gautamgadipudi82138 жыл бұрын
The best sir ever !!
@AkashYadav-mr4hg5 жыл бұрын
bro you are awesome.....i owe you .
@Batmanyank8 жыл бұрын
Thank you sir.. Nice explanation!!!
@alaekharkouk97198 жыл бұрын
+Mayank Neema add me to face book i need to took you i have a problem in an exercise minimization facebook.com/alae.kharkouk.9
@TanayPahare9 жыл бұрын
Thanks a lot brother! You explained it really well.
@arjunvirat84506 жыл бұрын
Thank you a lot... You made to understand too easy.... Again a thank.....
@SalimKhan-rg1lp5 жыл бұрын
Equal states go to same behaviour state or states q0,q1,q2 have same behaviour Y You separate q1
@shree27106 жыл бұрын
It's not the correct place or time, but must say the dude is handsome
@KrisAkaVenno5 жыл бұрын
xd
@faizutty8 жыл бұрын
we got 2 equiv: as [q0,q2],[q1],[q3],[q4] at time 14.04... but in 3 equivallent we check for (q0,q2).. (q0,a)= q1 (q0,b )=q2 (q2,a)=q1 and (q2,b)=q2... then we can check in 2 equiv: table.. q1 is saparated... then how we can said that they are equivallent.. pls help me
@malharjajoo73938 жыл бұрын
+Faizal Basheer - Good point , I was wondering the same thing.
@malharjajoo73938 жыл бұрын
+Faizal Basheer - I think I get the logic. Think about this- if q0 goes to state q1 on symbol "a" , and q2 also goes to q1 on"a"... similar for symbol "b" .... then they are equivalent. This is in accordance to his explanation from before ....the problem you said , will only arise if while comparing two states , we go to two "different" states on a symbol. In this case , BOTH q0 and q2 are going to either q1 ( on "a" ) or q3 ( on "b").
@faizutty8 жыл бұрын
+malhar jajoo haii... I got the logic later when I experienced with another examples..
@faizutty8 жыл бұрын
+malhar jajoo thank you my friend for this great explanation
@malharjajoo73938 жыл бұрын
+Faizal Basheer - you are welcome my friend.
@brookspatrader4 жыл бұрын
Thanks a lot, it's a very clear explanation!
@AshutoshSinghQuick8 жыл бұрын
More than what I learnt in my lectures! :) Thank you sir!
@dharmikthakkar80726 жыл бұрын
Thank u so much Great teaching 😘
@saurabhhublikar316810 жыл бұрын
Awsome explanation ...thx..
@anuraagkansara45867 жыл бұрын
Fantastic explanation!!!
@nitisrigirkala63355 жыл бұрын
turing machine videos sir plzz upload
@samgedam06 жыл бұрын
what to do if pair of a is in one state (for eg in non final ) and pair of b is in another state(for eg final)
@mirzahammadfareed99988 жыл бұрын
very well explained sir ! now i have got the clear concept of minimizing a DFA.. thankyou so much ! (y)
@rualani57825 жыл бұрын
Very easy to follow and helpful.
@duanakshbandi64943 жыл бұрын
what to do if my q3 does not have a 'b' transaction so it's blank in the transaction table? how can I compare it with the others?
@vaibhavchopda049 жыл бұрын
Thanks sir. .... It was helpful
@arpitsharma25048 жыл бұрын
thankew So much sir :)
@silentrobi29057 жыл бұрын
sir, you are awesome :)
@19071997able5 жыл бұрын
but for cheching 3 quiv. for q0 and q2 , they are going to q1 on a but q1 is already separated, then how can we make them one?
@priyankachaturvedi44453 жыл бұрын
Please tell nfat to dfa conversion in which set of all strings over input symbol a, b in which second symbol from lhs is a
@AdeshPaul4 жыл бұрын
Thanks. If there is a dead state in this F.A. then do we have separate it in the next equivalence?
@MadForCs168 жыл бұрын
ty sir !!/you've always helped me !!
@hawrehd51049 жыл бұрын
Great work thank you
@sanjeev_boltan4 жыл бұрын
Well Explained ,sir . Thanks a lot.
@niharikasingh59967 жыл бұрын
best teacher
@mounaboujrad3967 жыл бұрын
your video has save me ... thank you so much
@snapereviews5 жыл бұрын
Very good explanation. Thanks
@bhalsodnirva1046 жыл бұрын
sir,how q0 and q2 are same quivlent???you said that we have to check in the previous equivalence list so in previous equivalent list,q1q2 are not in same group. Plz reply soon..i hv my exam tmrw...
@mustakimshah67067 жыл бұрын
Very much useful. Thanks sir!
@sugatasaha44234 жыл бұрын
Nice explanation.
@vaishnavimanghat45767 жыл бұрын
good ... understood clearly
@biplabbarman11897 жыл бұрын
love this method exam in 20 minutes.....
@nileshgamare68425 жыл бұрын
Thanks sir now I understood very well
@karthik24kasula6 жыл бұрын
why cannot we combine the final state.... as the final state as same transition as q0 and q2 on input a and b?
@praneeth92155 жыл бұрын
Thank you so much sir
@ayaanqui4 жыл бұрын
2:43 Boi stop flexing
@mitaligoyalkhandelwal16527 жыл бұрын
Can't we see from table rather than comparing equivalence? Please ans
@ganeshbiradar66993 жыл бұрын
Super 100 /100 excellent sir
@bhanuteja36295 жыл бұрын
Is partition method belongs to myhill nerode theorem?
@pavankumar-tv7pp6 жыл бұрын
Great explanation.....
@afaquejaya25246 жыл бұрын
Sir, can you please tell me the regular expressions of that dfa?
@SanjaySingh-hw2cq7 жыл бұрын
if i dont remove tht state which is not reachable from initial State thn wht happens....? n can i solve my ques in exam without removing tht state....?
@sayalimutkule9429 жыл бұрын
Thnk u dea dat ws really helpful
@AlexFyra9 жыл бұрын
how are q0 and q1 equivalent if they go to the same state on a but to a different state on b? 8:45
@shubham983098 жыл бұрын
+Alex P. because both q1 and q0 belong to the same upper equivalent group that is they both belong to 0 equivalent group.
@adityatanwar73016 жыл бұрын
you did not read the definition right.it is because they are both going to a non final state. condition was either they must go to a final state or non final state
@rahulsuryawanshi43966 жыл бұрын
It was helpful Keep it up 👍👍👍👍
@kamalhm-dev8 жыл бұрын
Man, why do you group q0, q1, and q2 in the same grouping?
@davogrady7 жыл бұрын
but q3 is not an accepting state and he grouped it together with q4.
@42seitbamitsingh242 жыл бұрын
video hidden kyu kr dia exams hai sir
@rathandevaki14915 жыл бұрын
thnq soo much #BROTHA
@shiwanshukumar41867 жыл бұрын
Sir , at 14:28 qo and q2 are going to q1 and q2 (on a and b ) respectively , whereas q1 is in different group. Hence we cannot put qo and q2 in same group . Kindly explain, if I am wrong .
@naveenkumar-fn8nh7 жыл бұрын
at 14:28 qo and q2 are going to q1 and q2 (on a and b ) respectively but q1 and q0 are in the same group in 1 equivalent so u should not separate it. because when u r writing a new equivalent u need to check with the previous equivalent, if they belongs to same group in the previous equivalent u should not separate otherwise u can separate.
@niharikachaturvedi62186 жыл бұрын
naveen kumar But for 3 equivalent state we only need to check previous 2 equivalent state, right?
@RAJEEV_NITIAN_0076 жыл бұрын
refer to 2:04 when sir said if (p,q) on seeing any i/p goes to same non final state then they are equivalent.So in this problem (q0,q2) goes to same state (q1,q2) on seeing i/p a,b so they are equivalent.
@umarkhan-wh2zq5 жыл бұрын
but they are going to q1 which is not in the first brackets
@chitrakarsanket9 жыл бұрын
Thank you sir!! can you please suggest me the best book for referring TOC ?
@jashanpreetsingh43689 жыл бұрын
+sanket kurude K L P Mishra ( theory of computer science )
@user-iv6gu3ls5b6 жыл бұрын
Really helpful!
@sagaralwani754 жыл бұрын
Thank u sir it's really helpful In last step seeing 2 equivalent we can say that q1 is in another set How q0 q1 are taken in same group pls help (I'm talking about 3 eqivalent)
@igautammunot87143 жыл бұрын
As u can see that q0 and q2 upon scanning with a and b reaches to same state as q1 and q2 respectively so they will always be equivalent, don't consider previous equivalent (in this eg. equivalent 2) in such cases
@rustamahmed75197 жыл бұрын
Why not we directly combine two equal transitions? like like rows 1 and 3.
@5d8vamshiyaradeshi584 жыл бұрын
Thank you so much
@khanhakeem25907 жыл бұрын
sir, agar given table me final state na ho to us ko kis tarah minimize krte hai
@TheSunAgain7567 жыл бұрын
A DFA without a final state is known as a transducer. Mealy and Moore's machines are the example of FSM transducers. Since they produce an output corresponding to each state, it doesn't make sense to reduce their states.
@peerkhana88597 жыл бұрын
awsm explanation..
@amalsb26486 жыл бұрын
Sir pwoliyaan
@Jaiveer9628 жыл бұрын
Sirra sir sirra explanation
@akhilvarma66486 жыл бұрын
why we need to group q0,q1,q2 in one group and q3,q4 in another group how did we differ that??
@faizsyed6586 жыл бұрын
watch the whole video
@karangames249 жыл бұрын
very helpful.. fully technical... hitted subscribe.....!! one request from my side if possible share some short tricks for verification!!
@hjolany19836 жыл бұрын
good teach, buddy / thank you.
@singhRajshree7 жыл бұрын
How did u decide that q0 and q2 after combinig are start state???
@IhsaanMuhiyadheen7 жыл бұрын
Because q0 is the initial state in the question. Just like q4 is the final state in both the diagrams, q0 is the initial state.
@amitoshgain80329 жыл бұрын
Sir, Which method(Method name) are u used in this minimization.
@phoebedear93985 жыл бұрын
Partition method
@yasirjune693 жыл бұрын
Thanks.
@saswatobiswas7 жыл бұрын
Thank You Sir..
@shriram22758 жыл бұрын
Thank you sir!!! :)
@tapanjeetroy82666 жыл бұрын
thanks a lot sir..
@hodhaifachichi14796 жыл бұрын
nice explication thnks
@saumyojitdas42126 жыл бұрын
Myhill nerode theorem?
@rajeevmalhotra65678 жыл бұрын
if question is asking to minimize using Myhill Nerode theorem then we can solve it by using this method
@user-sb3or1ns3p3 жыл бұрын
the best!
@philipe00708 жыл бұрын
Morning, i need to construct a AFN with this ∑ = {0,1} ER = {0,1}* {1010}