Minimization of DFA (Example 1)

[@johnrichard5486]

You have saved the lives of many CS students.... thank you for all your videos ♥️

[@xinhaizou9240]

1 life being saved +1

[@harlemeugene3786]

i know im asking randomly but does anybody know a method to get back into an instagram account? I was stupid lost the password. I would appreciate any assistance you can give me.

[@xinhaizou9240]

@@harlemeugene3786 Sorry to hear that. But I think Google may give you more reasonable answers. :(

[@shabareesharyan]

@@harlemeugene3786 retrieve from Google account associated to your Instagram

[@anonymousfan9703]

@@xinhaizou9240 he is boosting confidence of this content creator with his positive view Why u chinese came every where and spread negativity 😕

[@mousaabdelnabyahmed878]

let me say that"You are a great man"

[@bowenzhang2259]

U are truly a lifesaver!!!!!!!!! I spent 2 hours reviewing my professor's lecture slides and still couldn't figure out the idea. And now, I completely understand everything within 15 mins watching your video. Thanks so much. Love from China.

[@sakshamchhatkuli271]

We start with 0-equivalence. Basically create 2 subsets, one with final states and the other with non-final states. Now within each subset, try to find if constituent states are 1 equivalent. The way to do that is to pick two states at a time. If the two states transition to the same 0-equivalence subset on each input, then they are 1-equivalent. If A,B and B,C are 1-equivalent, then A,C are also 1-equivalent. If A,B are not 1-equivalent and B,C are, then A,C cannot be 1-equivalent Repeat this process recursively till the output of n-equivalent and (n-1)-equivalent is the same From that point, the subsets won’t change All states within the same subset are equivalent

[@samarthdixitt]

In 10 minutes now i know a full 10 mark question, thank you so much for such precise and crisp knowledge! tomorrow is my exam

[@saurabhkuntal3013]

but marks to bhai 6 hi dega , khundas nikalte h professor yt methods s

[@samarthdixitt]

@@saurabhkuntal3013 pass hogya Lekin wahi kaafi hai 🤝

[@afsalts5872]

​@@samarthdixittu replied after 1 year.😮 How did your studies go

[@samarthdixitt]

@@afsalts5872 passed all of my exams

[@keeplearning9670]

​@@afsalts5872😅

[@swedishguyonyoutube4684]

Incredibly clear and pedagogical approach to teaching. A lot of professors would do well to take a page from your book.

[@zerobit778]

For those who have problem with 3 equivalence. Neso means that for the same input, the output should be stay in the same set. That does not mean both output for a state should stay in one set!!!! You would be more clear to his logic in next video.

[@lockyer8315]

For those having confusion in 3 equivalence, both B and C belongs to different sets but with same transition(0 or 1) they belong to same set. Hence A and C are kept in one set.

[@rameezsiddiqui6710]

bhai thoda detail me smjha do smjh nhi aaya'

[@Aditya-wy4ci]

But the criteria was that the transition satate should belong to the set? B was not the part of the set in 2 equivalence?

[@aryangupta4878]

@@Aditya-wy4ci I think that maybe the next states of both A and C should belong to the same set.

[@yashmalvade5961]

You have saved the lives of many CS students.... thank you for all your videos🥰😍🤩😘

[@esthersechos]

You are such a wonderful teacher!! Two weeks worth of confusion solved in 30 mins!!

[@SheetalSharma-eq9gh]

Thanku so much sir💯 .. I can't believe I got the concept so easily , as before 15 minutes , I was striving to do a question in my assignment ! and now after seeing this , assignment seems like a 5 min task .

[@leonelp9593]

Thanks so much man Greetings from Argentina

[@vijaykummari6684]

I think In equivalence 3- A and C doesn't go to same set as in input a B belongs to another set

[@siddheshdeshmukh3635]

I agreed 👍👍

[@siddheshdeshmukh3635]

It was to be in separate state

[@siddheshdeshmukh3635]

@Neso Academy please resolve it or admit it to all

[@jatinthakwani5370]

I don't know how to thank you. God bless you!

[@trevormr769]

I dont know how to appreciate you for the great work..thank you aloot words cant even express the thanks i have

[@bongdude752]

one of the best tutorial video for state minimization. thank you.

[@nagaomkar]

NESO academy....You are the best...hoping for more videos of computer science core subjects...it will surely be a great gift for us...it will also bring u a LOT OF MONEY(as views and subscribers increase)& its gonna help the students a lot

[@Sirisha177]

I thought it's so tough.. but after seeing your vdo I felt it's so easy.. thank you sir.. 😊

[@dhruvdornal803]

at 10:15 A and C on getting input 0 goes to B which is not of the same set so how are the equivalent ?

[@ItachiUchiha-ub2iu]

Your videos are exam saver !

[@kaywilfert8297]

I tried and failed so many times with my teachers strategy. My teacher is very knowledgable and competent but I seem to be incompatible with his teaching style. This however I got on the first try. Thank you very much

[@tanishqarora6655]

Super easy explanation super easy to understand Loads of thanks to NESO Academy

[@dkd0m23]

Hey thank you for the explanation, helped me alot :)

[@harishks308]

Thank you bro...very helpfull in last minutes of exams🙏well explained💯❣️

[@dengan699]

Very clear, thanks man, I was literally reading the description for a week without grasping it, it's so confusing when written in plain English

[@TWGuardian]

What a remarkably simple and insightful methodology. Many thanks!

[@thegymrat1791]

Thank you so much sir, you literally saved my life!

[@mahesh_bvn]

I usually don't comment on any videos but I must have to say that you are a legend🙌

[@warrior100girl]

always better than my own professor

[@BiLiMsElGuEyE]

warrior100girl Me too🤣

[@mohanamvenkatesh3852]

Thank so much sir, your explaination is easily understable and simple 🤝🤝

[@PomegranateAmazing79]

how A and C are 3 equivalents? because output of A and C have B which is in a different set in 2ND equivalence.

[@xendu-d9v]

A and C go to same state B(taking 0) and C(taking 1)

[@saisriramgovardhanam302]

Siddharth Y if they goes to different states then u check whether they r in same set ,if they r in same state then no worries!

[@PomegranateAmazing79]

got it. thanks

[@naveenksingh8485]

Zabardast hai

[@ChristianBurnsShafer]

B is not 2 equivalent because it maps to a different set than A and C for input 1 (A and C map to {A,B,C} and B maps to {D}). A and C are three equivalent because they map to the same set regardless of the input ({B} if 0 and {A,C} if 1). Furthermore, they are n equivalent for integers >= 0 as they will always map to the same sets respectively.

[@SrivarenyaThuluva]

obsessed with your videos sir🤩so knowledgeable from btech B section

[@alessandromorelli5866]

So, what I get is that for n-equivalence just check, if they go to the same states with the same inputs and have the same type of being final or not, then they go together, that's it: both A and C can be joined because of the outputs, however E can't because it's a final state, if there was a F state that had the same outputs and was also final it could be joined with E, but not with A and C. Hope i was clear.

[@simransinghi4342]

Just love your videos😄..saved me lol!😂

[@arunyadav4439]

👌👌👌💖💖

[@KKukreja]

My summary We start with 0-equivalence. Basically create 2 subsets, one with final states and the other with non-final states. Now within each subset, try to find if constituent states are 1 equivalent. The way to do that is to pick two states at a time. If the two states transition to the same 0-equivalence subset on each input, then they are 1-equivalent. If A,B and B,C are 1-equivalent, then A,C are also 1-equivalent. If A,B are not 1-equivalent and B,C are, then A,C cannot be 1-equivalent Repeat this process recursively till the output of n-equivalent and (n-1)-equivalent is the same From that point, the subsets won’t change All states within the same subset are equivalent.

[@trevortrusty]

it seems like if they transition to the same exact state, then it doesn't matter if they are in the same subset or not. I feel like that wasn't explained clearly in the video, but that seems to be how he did it

[@badaraupetru2557]

two states would be equivalent if they transition to states from the same set of states from precedent equivalence or transition to the same states for each input. in case of 1,2 equivalence the transition goes to the precedent subset for third equivalence we have for input 0: A->B, C->B and for input 1 A->C, C->C

[@ramankumar41]

such a wonderful explanation...Very Helpful !!!! Thanks Man

[@sumanthsajjan5784]

i see a man of culture in you

[@Nopenotnitish]

Thank u so much❤️!! u just helped me to gain half of the marks in my internal exams

[@루이스-b9w]

you are truly saving my compiler course exam in my uni sir.. 2 days left till exam

[@rushikeshdhane4755]

How was your exam 😂😂😂

[@senzmaki]

yoooh we wanna know

[@امینجمالی-خ9ص]

thank youuuuuuu. great explanation I didn't get the algorithm in the text book but your video clarifies everything.

[@Haryanvi_Fun_Top]

very simple and impressive method to minimize the DFA

[@anwarkedir4507]

Thanks Liked it all from Ethiopia

[@piyalimondal3006]

Thank you Sir 🙏🏻🙏🏻... It's really very well explained Video😊 ... Greetings from West Bengal

[@ch1n3du3]

thank you for all your content, it has helped me go through my most difficult courses.

[@Karansingh-gh4oy]

thankyou very much reallly needed good work sir.... n please make vedios for Microprocessor

[@ruchimgowda4300]

This helped me a lottttt I can't tell how grateful I am

[@Tbm4545]

All went over my head

[@TheGiantTechnologies]

Thank you! Very clear

[@Mr19242]

Sir firstly thanks for your videos here I want to tell you that you have missed concept of unreachable states as you directly applied checking state equivalence and in some questions if we dont remove unreachable states then our final state have that extra unreachable stat e and thus it will not be minimized(correct). Although it is also advised to merge all dead states into one before applying this video's method but is optional as applying the method shown in this video will automatically do that.

[@Uta-t9v]

Thank you you saved me from falling ❤

[@chavaligangadevi8663]

Good explanation sir

[@Work-uv8gn]

Thank you friend for making this so simple

[@creativenature3699]

Better than my lecturer ✌️

[@EM-gs1ou]

OMG you saved me!!!!!!! This is actually fun now too

[@corporateLabour404]

savior of the backbenchers !!

[@Luckyracer-m5c]

Thank you Neso Academy😘

[@akashjain884]

thank you so much sir for great learning through the channel today i have an exam and i a clearing with the exam topic

[@christinekasangili6846]

Thank you so much for teaching us

[@arunyadav4439]

👌👌

[@suryak9913]

Tqsm sir... For making me understand. Good explanation

[@bishambhorthokchom6580]

Simply u r better than my college teacher tysm

[@thoughtsofyouths]

Very Helpful this Video for CSE students

[@alibulus4382]

Why A and C are 3 equivalences ? When 0, A and C are going to B and B. But when you look at the 2 equivalences list, it is {A,C} {B} {D} {E}. B is not in the list. Are we looking for just A and C are going to the same set ?

[@KevinGarcia-ws1kt]

Thank you everything was so well explained.

[@FUN_STATION_SK]

At 10:4 3rd equilence {A,C} belongs to different sets ..how can be both equilence

[@hritiknagpure]

Thank you sir for explaining very easy 🙏

[@praveen.sharma]

Brilliant ... Everything explained to the point !

[@ArthurKing7634]

You save my compiler homework!

[@janhavishrivastava9979]

Thank you very much sir

[@iiaamm]

Congratulations on 10 lakh subscribers 🥳

[@aditinamdas8004]

Nice explanation 😊

[@vaibhavnirmal4845]

Thanks you so much for this explanation

[@Gaurav-gn2xq]

Thank you so mUch for such awesome explanation .

[@mugilcloud1860]

Sir .. in 3 equivalence how a and c are in 3 equivalence since a and c has comman as b so how they become same set

[@mrgamer.5234]

Thanks sir ... From Pakistan 🇵🇰❤️

[@ArpitDhamija]

neso is back

[@pratyushranjan_3061]

thanks sir appreciate the work

[@29feb65]

Thanks sir love you 😊❣️

[@adinarayanam9903]

Excellent ⭐️⭐️

[@bhawanishankarsharma6654]

Nicely explained.... Thank you sir

[@rakshitadungdung5060]

Quality education = Neso Academy

[@alokraj3524]

How, 3 equivalence of {A, C} is {A, C}. Please Explain.

[@shalinimondal779]

You saved me man... 🥺🥺🥺🥺

[@abhijitb1501]

U are a legend dude

[@gurunadhan2666]

Thank you from Sweden🇸🇪❤️

[@AdelNourbakhsh-v9u]

amazing teaching

[@apporvaarya]

wow, you explained in a mind-blowing manner :)

[@gedelasivakrishna]

Thankyou !!

[@diwangdiwang815]

Thanks a lot 🙏,tmr I have my internals

[@hrishikeshkashyap3715]

How come in 3 Equivalence, A & C are equivalent to each other? On getting input 0, both A & C go to state B which is outside of {A, C}.... So, how come A & C are 3 equivalent to each other?

[@janisar_hyder]

if you have same states on input 0 and 1, you dont need to check set in case of set {A,C} 'A' goes to 'B' on input '0' and 'C' also goes to 'B' on input '0'(same state 'B')... and on input '1' both are going to 'C' so you dont need to check the set {A,C} because both are going to same state

[@hrishikeshkashyap3715]

@@janisar_hyder Thank You

[@dumi7177]

you are a genius

[@shayanfar6521]

Thanks a lot. It really helped me. I appreciate that ♥️♥️♥️

[@ai.201]

Simple and easy.

[@saptarshiroy3943]

How come A and C are 3 equivalent to each other? On comparing A and C, A and C on getting an input 0 goes to B whereas on getting input 1 goes to C. So how come they are equivalent if they are not on the same set?

[@ujjwalbhardwaj1519]

Correct

[@Nomnomnom165]

​@@ujjwalbhardwaj1519no it's not correct

[@Nomnomnom165]

The output that A gets on 0 may be in a different set than the output A gets on 1, same goes with C However, what we are checking is for 0, are the outputs of A and C in the same set, and for 1, are the outputs of A and C in the same set On input 0, A and C go to B, which is the same set as each other On input 1, A and C go to C, which is also the same set as each other For 0 and 1, the set of the output state doesn't have to be the same

[@user-jw9uo6vs8v]

First condition is to check that , they goes for same state or not ,

[@heavencanceller1863]

Great explanation!

[@aishu4980]

Thanqq so much sir❤️

[@sairajdas6692]

Extremely helpful to the point

[@azshalen]

He says, at 1 Eq that D is separated because of the output of 1 being different between, let's say A and D, but B is the same, yet he says that B remains in the group.

[@druthi9700]

At first, D is in the group, so B is accepted.

[@_singh_piyush_]

Thank you so much for the help

[@karnatisaimanikanta6166]

If u observe the transition diagram a, c, and e also same (since e also producing output same as that of a and c)?

[@ManiTeluguGamer23]

Nice explanation tqu sir