Myhill Nerode Theorem - Table Filling Method (Example)

preview_player
Показать описание
TOC: Minimization of DFA – Table Filling Method (Example)

This lecture shows an example of how to minimize a DFA using the Table Filling Method also known as Myhill Nerode Theorem.

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

I literally paused the video and tried the whole question and guess what i could do it your explanation in previous video made it so so easy thank you

avinash
Автор

Thank you sir for the explanation
I'm watching Neso academy lectures for quite a while. They're quite intelligible and reliable
I get the best explanations for my problems. Thank you Neso Academy

ruthviks
Автор

Nicely done. Just one remark because of the overhead at the end.
One doesn't have to repeatedly evaluate the transitions.
e.g. (A, B) with inputs 0 or 1 will not change later on.
Write them down once and just read them when necessary.

hyphenpointhyphen
Автор

I love these lectures, these are just life savers and also grows the interest towards the subject which was nearly impossible for my college professors. 😁😁

himadriroy
Автор

it was an informative video.. i learnt alot.. but yes a small thing i would like to add is that u dont need to repeat iterations in 2nd step when you have already checked all pairs in 1st.. just trace them from above and move on

sajidsarwar
Автор

Easy to understand, thank you for uploading! Definitely helping on a project

CalmThrill
Автор

Wow. What a perfect and clear example.

traviswaterlake
Автор

Thank you so much for the explanation. It is very simple and understanable, great job!

nhan
Автор

thank you for your patience in teaching! It helps a lot

akihana
Автор

one of the best and well defined video thanks alot

aniketchander
Автор

sir your teaching helped me a lot.thanks for uploading sir. ur awsome

vamsikrishna
Автор

Oh! I wish I can give you million likes and million subs.. U r amazing sir.. Thanku for saving us.. U r iron man.. 🤗

nisha
Автор

I love you! Thank you for everything...

miguelnuno
Автор

Thank u for sharing valuable knowledge.

shoaibali
Автор

But sir, In previous lecture there was also some uncheked pair we were combine them and made a minimize DFA. BUT im this video we are repeating step 2, May I know why sir?

tellmejanab
Автор

I feel like these minimization methods are just good ways to check complex DFA's because I feel it's not too hard to intuitively see which states can combine as long as you don't make the mistake of combining the end states with the input or combining the end state with a state instead of the input.

hugojj
Автор

Very well done, helped me a lot, thank you!

shuchi
Автор

thanks for explanation. it's better than half of semester at my university

МаксимИванов-см
Автор

legend! thank you so so much, just the best for you

VisionaryVII
Автор

holy shit. I understand you clear than I understand my professor.

DamianPerez