No video :(

Myhill Nerode Theorem - Table Filling Method (Example)

Подписаться 2,6 млн

Просмотров 493 тыс.

50% 1

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.
Contribute: www.nesoacademy...
Website ► www.nesoacademy...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
• Axol x Alex Skrindo - ...

Опубликовано:

24 авг 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 102

@avinash2462 2 года назад

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

@abhiMisc. Год назад

Yes sir its just like that with me now

@yaminiseerapu Год назад

excellent!!

@hyphenpointhyphen 7 лет назад

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.

@AP-eh6gr 7 лет назад

true that

@sonit9707 Год назад

@@meow91japan sums it up

@itsmoi5673 6 месяцев назад

Lol I was like wtf is he doing

@ruthviks5791 2 года назад

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

@himadriroy7980 Год назад

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

@sajidsarwar 6 лет назад

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

@CalmThrill 5 лет назад

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

@traviswaterlake9486 5 месяцев назад

Wow. What a perfect and clear example.

@yashparmar5722 Год назад

Thanks❤

@asnakhan7215 4 месяца назад

concept was v well explained

@nisha1841 3 года назад

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

@HarshGupta-wi1zn 3 года назад

All the colleges should buy these videos and use this videos officially to teach students because College teachers either don't want to teach in these ways or either they can't

@DamianPerez 7 лет назад

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

@abhishekfarande9672 2 года назад

recommend him/her this channel

@nhan1503 4 года назад

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

@akihana4113 3 года назад

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

@user-vn2oj8pu1l 2 года назад

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

@miguelnuno928 3 года назад

I love you! Thank you for everything...

@saumasischandra8114 3 года назад

Time passing method should be its name. 😂

@sarparslan8035 9 месяцев назад

Very clear explanation thank you sir

@hugojj101 Год назад

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.

@vamsikrishna3093 4 года назад

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

@aniketchander2768 6 лет назад

one of the best and well defined video thanks alot

@shoaibali4309 4 года назад

Thank u for sharing valuable knowledge.

@shuchi4733 2 года назад

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

@gourangpathak4443 Год назад

Nice Explanation

@VisionaryVII 8 месяцев назад

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

@harrisonakunne5119 Год назад

Really great explanation 👍 Thank you so much!

@chemistrypoint756 2 месяца назад

thanks sir

@tirthtrivedi7622 2 года назад

great explaination

@KadelandTheWizard 4 года назад

ありがとうございます。

@tahmidtaki7789 7 лет назад

thank you, it was very helpful

@tellmejanab9136 3 года назад

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?

@rujin6259 3 года назад

We repeat the step in all the problems. In the case of the previous one, had we repeated the step, we would have arrived at the same table. Hence it wasn't shown.

@Apoorvpandey 2 года назад

@@rujin6259 Thanks for the explanation

@afsanaaftabshaik3321 Год назад

@@rujin6259thank you for explanation😊

@harinandananbs3158 2 года назад

Day before exam at 2x speed!

@clickbait1050 7 месяцев назад

great video! keep up the good work💪💪

@uttambhandawale2970 7 лет назад

awesome teaching sir....perfctly understood

@HosRo4161 Год назад

very clear! excellent!

@haftukalayou1491 6 лет назад

Interesting lectures thank you very much.

@prajaktajadhav8419 5 лет назад

thanku sir. nice explaination

@gopiyv9227 7 лет назад

excellent teaching sir I'm easy to understand thk u so muh

@mikhailfilatov108 6 месяцев назад

Please notice that conflict will be acquired in LR(1) table for given grammar

@sonasreedhar.1669 3 года назад

Thank you so much sir🙏

@souravbera847 5 лет назад

Thank you so much Respected sir..............

@maninderkaur1678 10 месяцев назад

Thank u sir so much 😊

@nehamusale4958 5 лет назад

Nice explaintion...

@mshafiee856 7 лет назад

Perfect and clear!!! Thanks.

@naveenprathap922 7 лет назад

M Shafiee

@renusindhu1393 3 года назад

Thank you😊

@bhuppidhamii 10 месяцев назад

start marking them from down to up. i'll be easy.

@ashiksaleem360 3 года назад

thanks a ton

@dhanushsivajaya1356 3 года назад

Thankyou sir

@DudeOliver 4 года назад

ty boss

@vardhannegi677 4 года назад

this method suck why we need this method over partitioning method(which is more simple and sort)?

@praveenr6933 4 года назад

Thanks guru

@saharamanson1970 4 года назад

Nice.. thanks..

@s.rajan0412 6 лет назад

2nd step doing twice (BA) (CA) (CB)

@thepyrex1465 4 года назад

What if it have multiple final state using this method?

@7AlexTV 7 лет назад

Thank you friend, a question: can i use table filling method to Mealy state machines? hug.

@nileshaggarwal424 6 лет назад

What song is this, which is played at the end of every lecture??... I just love it Sir your lectures are amazing, and you discuss every case possible. Love NESO 😍

@codingsingh4156 6 лет назад

you ft axol alex skrindo

@nileshaggarwal424 6 лет назад

YOUR ex thank you 😋 Love NCS😍😍

@joytunsiddika1557 8 месяцев назад

in (c,0) it goes to b so why didn't we mark it in the last?

@piyushchauhan735 6 лет назад

how can you take (C,D) same as (D,C). that is not possible and if it is that should be true for all the others too....please explain it !!! Is it a mistake !!

@TheKseth 7 лет назад

at 10:11 sir how is CD and DC the same thing ?? Plz explain!

@SimeonStanchev 7 лет назад

I think it is simply the same relation.

@piyushchauhan735 6 лет назад

same question from me !! how you took the same thing as it voilates the rule

@Apoorvpandey 2 года назад

any valid reasons yet?

@katyayini8445 3 года назад

Sir 11:30 how can (c, d) and (d, c) be equal.. As there is separate cells for both of these.. And for (c, b) pair while checking 'c' for input 1 we got 'c' and for 'b' input 1 we got d but there is no cell for (c, d) how can you mark that?

@saurabhsrivastavadance 3 года назад

Ohhh , helpful

@Coachizz-rf1kw Год назад

As u can there's C and D written there which cannot be marked as it not in the range. He inversed c and d to d and c and said d and c is marked soo we will mark c and b as well, idk if its right or wrong

@gokaysahin5772 9 месяцев назад

im confused about that too

@cvlog2818 3 года назад

sir please tell me what is the roll CD= DC, if we marked the CD then aalo we have to marked DC in above

@user-ko4gh5gk3l 11 месяцев назад

prakhar trivedi dtu 10 cgpa

@manavpatidar4153 Год назад

🔥🔥

@Hear_is_how 7 месяцев назад

Any one tell me is cd and dc is a same thing at 10:28

@mohantejachitturi2472 7 лет назад

unmarked pairs contain only either all final states or all non final states ! am i right

@malehakim248 7 лет назад

I have a problem understang how do you consider which is a final stage and which one isnt?

@FlyingSkuirrel 7 лет назад

For this particular example, the final state is E. Final states are normally distinguished with another circle around the state, or sometimes a square around the state.

@mohankumarcs9437 4 месяца назад

😊

@arpita0608 5 лет назад

CA been done two times

@sandeeprana3654 3 года назад

I laughed my ass out ..... Bt then i realised u were talking about CA pair in the question. I thought the time its taking to solve a question taking 2 times to clear a CA exam. Anyways equivalence method is better than this.