Myhill Nerode Theorem - Table Filling Method 

This man has saved my life two years in a row. Thank you so much!

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).

Your videos have helped me tremendously, kindly create videos for Pushdown Automata and Turing machine as well. Thank You

I was a bit sceptic at first, but your teaching is really outstanding. Worth every minute of watching. Thanks a lot!

Steps : 1) 3:00 Draw Table 2) 4:30 Mark 3) 7:00 Check for unmarked one 4) 15:00 Combine all unmarked

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...!!!

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.

One of the best teaching method by which every one can easily understand

Thank you so much, the pace and level of detail is just what I needed to finally understand this!

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!

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 .

Clear cut explaination.Thank you sir

Great video! Thanks for explaining so well

you are an amazing teacher! Your videos are always so clearly explained ☺️ thank you very much

Sir your videos are really good these videos can really saved my life every thing is explained awsm 👍

thank you for carrying us through our computational models class.

You help me so much on my Automata subject. Thank you so much!

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!

it's very easy and good method thank u Sir please come in UMT and teach the students they are wasting their life

Best explanation for this theorem.....Thanks buddy.

Superbly explained

very nice representation and explanation

great work bro you saved my life🙏🙏

Very nice sir,u teach so perfectly.

Excellent explanation sir.thank you so much 🙏

Thanks neso academy 👍👍

this man has saved my life too, however this theorem still is very hard

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!!!!!

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.

Very well explained!. Thanks.

best explanation online. clear and thorough

Very nice video & clear explanation 👌👌👌👌

Really loved this class ❤

Excellent, not a single doubt

THANK YOU SO MUCH! Please more of automata!

Great lecture 🔥🔥

Thank you so much for saving my day

Excellent one sir..

Thanks for your easy explaination. Really easy to understand 😊

Great Tutor :) Your videos are helpful .

thank you so much. Now my confusion is very clear.

SIr.. hats off to you.. Excellent classes... Sir, could you please explain whether we need to remove unreachable state in table filling method

Thank you sir, great explanation

Hello ! it's amazing you've just saved me. so helpful your video. thank you very much

YOU ARE GREAT SIRJI

what an explanation sir!!!!! keep it up

nice video my concept were ruined but after watching video it help me again to make my concept.....thanks a lot

Ty for the clear explaination 😄

Thank you so much Neso Academy you really saved my ass

very nice explanation for understandig.

You're highly detailed person Thx :)

Thanks sirr Understood all things related to this video

thank you so much sir I have TOC exam on 24 june

Best explanation , thanks.

best explanation

Thanks very much for the explanation 😊😊😁👍

You're a legend!

Excellent teacher!

amazing explanation sir thankyou

thanks sir this video is very helpful for me

humara dil aapke pas hai heart 💓

Another amazing video!

Thank you for giving your knowledge ☺

Excellent explanation. Thanks a lot!

Superman of minimization of dfa

Excellent explanation. Thanks a lot! Could you please tell me the reason why not remove state F. state F is dead and Inaccessible

great explanation!

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.

Спасибо тебе, индийский друг! Ты спас мой зачёт:)

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...

It's really very helpful thnxx😄😄

Nice explaination sir....may I know from where you are...love from india 🇮🇳🇮🇳🇮🇳

Well Explained !

Thank you, sir.

THANKS FOR SAVING MY GPA!!!

This guy is explaining this subject better than my professor. Sad story

Very nice explanation thank u

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).

In my opinion this theorem is not easy like previous one!!

Thank you so much sir💓

Do yourself a favor and watch this at 2x speed

Awesome video!!

Thank you so much sir!!!!

I prefer previous method

Wow nice sir...

crystall clear

Thanks sir it's help ful for me

Very clear, thank you very much!!

awesome 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?

Thanks a lot! you helped me so much....

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.

Thank You Sir..

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?

You are great 👏👍