Awesome job done by the NESO team. Your Videos are great. They help many students like me to understand difficult concepts very easily. Thank You Team NESO...!!!
Absolutely brilliant lecture. Table filling method is one of the hardest but also the most beautiful method to minimize one of the most complex data structures like DFA.
I will prefer to worship you daily and will make a statue , my savior! my God! Master of Explaining things Easily! You are really gr8 in teaching DE and TOC!
Lmao, i was following along doing my homework with him and when I was done and went back to check my work i noticed that i was working on the exact same problem and got the same answer. its either a small world or there is some trickery in the works here, lol. Many thanks!!!!!
if (C,D) is unmarked pair and (C,E) is unmarked pair then can combine and form (C,D,E) a final state in DFA. if not then what we have to do in that case.
When checking (P,Q) = (F,B) (13:40), he didn't check for transitions on value = 1. Technically it would be the pair F,D on 1, which is checkmarked already. Did the video forget to check that, or is there a rule on when we have to check all values to be check marked?
for 3rd step, what you wrote was enough right? we have already seen the outputs for all unmarked pairs, for checking once again we just have to take a look at the output again right?
See DFA responds to each and every symbol ..Okay ? .... So Dead State also mandatory Atleast One dead state is mandatory as DFA is Complete (as it responds to every input )
At 6:37 (P,Q) = (F,C) Conditon is mark If P is final and Q is non final then mark (F,C) But in the question is F Which is(P) is non final and C which is(Q) is final state so why you marked in the table
Thank you sir .I am the follower of your course since my second year. I am worried that you did not made a playlist of microprocessor and micro controller.😥.. Ok I am satisfied with your available playlist.
Thanks for the explanation, it was helpful! i just want to clarify one thing. Suppose after applying this algo, i get 2 states such as (BC) and (EF) where E and F are final ( hence EF will be final as well), i am now left with 2 other states in the original DFA, A and D. A is the initial state. Do i have to combine A and D or make separate states? Quick response will be appreciated.
Very clear explanation! Thank you! However, I may have spotted a slight error in the video. Around 15:46, you write the pair (A, B). I reckon this should be (B, A).
This man has saved my life two years in a row. Thank you so much!
same XD, cracow IET 2018
Yes ur correct
All hail neso
Just reminding you of your comment 😁
0:08 0:08 0:08 0:08 0:08
Your video saves lives. We had to use this method on our exam and I couldn’t find any good explanation except this one. Thank you so much.
legendary tutorial. It's a good thing to NOT skip any part even if it's boring (you can skip it by yourself).
Steps :
1) 3:00 Draw Table
2) 4:30 Mark
3) 7:00 Check for unmarked one
4) 15:00 Combine all unmarked
I was a bit sceptic at first, but your teaching is really outstanding. Worth every minute of watching. Thanks a lot!
You are Gifted Teacher, thank you! I wish i had such teachers during my learning at school and university
Awesome job done by the NESO team. Your Videos are great. They help many students like me to understand difficult concepts very easily.
Thank You Team NESO...!!!
Your videos have helped me tremendously, kindly create videos for Pushdown Automata and Turing machine as well.
Thank You
your comment was 7 years ago
what do u do now?
Absolutely brilliant lecture. Table filling method is one of the hardest but also the most beautiful method to minimize one of the most complex data structures like DFA.
Thank you so much, the pace and level of detail is just what I needed to finally understand this!
One of the best teaching method by which every one can easily understand
I will prefer to worship you daily and will make a statue , my savior! my God! Master of Explaining things Easily! You are really gr8 in teaching DE and TOC!
you can help him by donating some money then.
@@devesh1697 Awkward Silence!🤣😂
Amazing teacher. Clearly explained this.
Great video! Thanks for explaining so well
Wow your teaching is extraordinary thanks for clarifying my doubts 😍😘
Thank you for your lectures.
This videos helped me a lot on the day before exam .
Yes you are right Supriya
thank you for carrying us through our computational models class.
Clear cut explaination.Thank you sir
u made an horrible subject to an easy concepts ty so much neso academy team making such lectures which are not at all boring...gr8 job
Extremely clearly stated! Thank you so so much!
Sir your videos are really good these videos can really saved my life every thing is explained awsm 👍
Lmao, i was following along doing my homework with him and when I was done and went back to check my work i noticed that i was working on the exact same problem and got the same answer. its either a small world or there is some trickery in the works here, lol. Many thanks!!!!!
Thanks neso academy 👍👍
great work bro you saved my life🙏🙏
you are an amazing teacher! Your videos are always so clearly explained ☺️ thank you very much
You help me so much on my Automata subject. Thank you so much!
In which class you are i am in 9th
@@jainishsah3678
@@banvithareddy4796 now i am in 10th
Best explanation for this theorem.....Thanks buddy.
Very well explained!. Thanks.
Do yourself a favor and watch this at 2x speed
i actually had to watch it 3 times to understand
i prefer it slow
wow coool
Do yourself a favour get lost
do yourself a favour get a life
Well, only if you're studying at the last moment like me.
Else, 1.5x would do the work. :D
if (C,D) is unmarked pair and (C,E) is unmarked pair then can combine and form (C,D,E) a final state in DFA.
if not then what we have to do in that case.
Great lecture 🔥🔥
this man has saved my life too, however this theorem still is very hard
Superbly explained
Really loved this class ❤
best explanation online. clear and thorough
Excellent explanation sir.thank you so much 🙏
very nice representation and explanation
Ty for the clear explaination 😄
Thank you so much Neso Academy you really saved my ass
Very nice sir,u teach so perfectly.
Thank you so much for saving my day
Very nice video & clear explanation 👌👌👌👌
Great Tutor :) Your videos are helpful .
Excellent, not a single doubt
Another amazing video!
615 vibes
it's very easy and good method thank u Sir please come in UMT and teach the students they are wasting their life
You're a legend!
what an explanation sir!!!!! keep it up
Спасибо тебе, индийский друг! Ты спас мой зачёт:)
YOU ARE GREAT SIRJI
Hello ! it's amazing you've just saved me. so helpful your video. thank you very much
You're highly detailed person Thx :)
Thanks very much for the explanation 😊😊😁👍
Thanks for your easy explaination. Really easy to understand 😊
Thank you so much sir💓
THANK YOU SO MUCH! Please more of automata!
When checking (P,Q) = (F,B) (13:40), he didn't check for transitions on value = 1. Technically it would be the pair F,D on 1, which is checkmarked already. Did the video forget to check that, or is there a rule on when we have to check all values to be check marked?
Best explanation , thanks.
Excellent one sir..
Thank you sir, great explanation
thank you so much. Now my confusion is very clear.
Thank you, sir.
Well Explained !
My college professor is crying in the corner after seeing this lecture
best explanation
Excellent explanation. Thanks a lot!
Thank you so much Sir...
Excellent teacher!
very nice explanation for understandig.
THANKS FOR SAVING MY GPA!!!
great explanation!
Thank you for giving your knowledge ☺
Thanks sirr
Understood all things related to this video
Awesome!! You totally saved my ass, my exam is 1h from now and this is the last subject I have to know hehe
Thank you so much sir!!!!
for 3rd step, what you wrote was enough right? we have already seen the outputs for all unmarked pairs, for checking once again we just have to take a look at the output again right?
What happens if, for example I obtain (X,Y) where (X,Y) does not exist in table but (Y,X) exists and is marked? Should I mark the pair or not?
Excellent explanation. Thanks a lot!
Could you please tell me the reason why not remove state F. state F is dead and Inaccessible
See DFA responds to each and every symbol ..Okay ? ....
So Dead State also mandatory
Atleast One dead state is mandatory as DFA is Complete (as it responds to every input )
SIr.. hats off to you.. Excellent classes... Sir, could you please explain whether we need to remove unreachable state in table filling method
You are great 👏👍
It's really very helpful thnxx😄😄
At 6:37
(P,Q) = (F,C)
Conditon is mark If P is final and Q is non final then mark (F,C)
But in the question is F Which is(P) is non final and C which is(Q) is final state so why you marked in the table
The entire engineering world relies on Indian guys on TH-cam
Jokes aside, great illustration and good explanation, keep up the good work!
Awesome video!!
nice video my concept were ruined but after watching video it help me again to make my concept.....thanks a lot
humara dil aapke pas hai heart 💓
Thank you sir .I am the follower of your course since my second year. I am worried that you did not made a playlist of microprocessor and micro controller.😥.. Ok I am satisfied with your available playlist.
Thank u so much sir🙏🙏
Thanks for the explanation, it was helpful! i just want to clarify one thing. Suppose after applying this algo, i get 2 states such as (BC) and (EF) where E and F are final ( hence EF will be final as well), i am now left with 2 other states in the original DFA, A and D. A is the initial state. Do i have to combine A and D or make separate states?
Quick response will be appreciated.
Yeah, I was also thinking the same....
Wanna know that too, and seems like no one answered it.
Individually sir
If there is an unreachable state do we remove it before making the table
amazing explanation sir thankyou
Very clear, thank you very much!!
thanks sir this video is very helpful for me
Very nice explanation thank u
many thanks man!
Very clear explanation! Thank you! However, I may have spotted a slight error in the video. Around 15:46, you write the pair (A, B). I reckon this should be (B, A).
Doesn't make a difference
Good observation
Superman of minimization of dfa
Thanksss Mannn! 🙆🏻♂️
tnxxx for the lecture
Thanks a lot! you helped me so much....