this is really well explained. i cant thank enough
@gold4963
2 жыл бұрын
Thanks so much for this video! I was able to trace through the example and figure out how to the use the algorithm and the distinction table!
@CipriValdezate
4 ай бұрын
Excelent and very helpful explanation, thank you very much.
@qqqqqqqqqqqqqqq67
2 жыл бұрын
Best CS channel on youtube.
@Edigor100
2 жыл бұрын
saved my homework assignment, thanks man
@bangvu2127
Жыл бұрын
Thanks for the great explanation
@stijnjongbloed1
Жыл бұрын
Thanks for the video!
@HeisenbergHK
Жыл бұрын
I have a very important quiz in just one hour Thanks for this video
@yerdauletseidizhappar8605
2 жыл бұрын
You are a lifesaver
@AshutoshGera
Жыл бұрын
Great video, thanks :)
@awsafrafin1467
9 ай бұрын
Thank you sir. It was easy.
@vimalathithand917
7 ай бұрын
Amazing!
@QmiStudying
Жыл бұрын
My teacher didn't really explain why the equivalent states work, I had a slight grasp of why the algorithm works but it never clicks. Thanks to this explation I can fully understand it, thank you sir
@keivansf3459
Жыл бұрын
Thanks a lot
@RickeyBowers
2 жыл бұрын
The state merging step, using the complete lower triangular matrix involves finding cycles? Thank you /so/much/ for working through these examples! You sir, are going to have a large audience in time. I'm going to try working through some larger examples to discover the groupings needed at the end.
@bigguccitaurus1395
2 ай бұрын
thanks for saving my life. i found it very difficult to motivate myself to get to know this subject, as it is quite theoretical and seems quite useless at first.
@saeedbarari2207
Жыл бұрын
this would be whole lot easier if scientists back then didn't call "distinguishable"s "not indistinguishable"...
@gold4963
2 жыл бұрын
12:10. Checking 1 and 2 a transition. 12:39. Checking 1 and 2 b transition. 13:00. Checking 1 and 4 a transition. 13:12. Checking 1 and 4 b transition. 13:28. Checking 2 and 4 a transition. 13:40. Checking 2 and 4 b transition. 14:10. Checking 1 and 6 a transition. 14:18. Checking 1 and 6 b transition. 14:28. Checking 2 and 6 a transition. 14:34. Checking 2 and 6 b transition. 14:43. Checking 4 and 6 a transition. 14:49. Checking 4 and 6 b transition. 14:58. Going through chart again, checking all empty spaces. 15:04. Checking 2 and 4 a transition. 15:09. Checking 2 and 4 b transition. 15:18. Checking 4 and 6 a transition. Checking 4 and 6 b transition is unnecessary; the a transition is already marked as distinguishable. Algorithm is now complete, and it turns out this is the minimized DFA anyways. XD
@Apocalymon
2 жыл бұрын
What does this have to do with the minimum circuit size problem?
@exponentialf
2 жыл бұрын
🔥
@lowerbound4803
2 жыл бұрын
18:50 Why couldn't array[3, 5] be marked during the process?
@scotthoward8308
6 ай бұрын
This took me a while too - 3 and 5 are defined as final states when he made the state machine (he just didn't say it out loud). They are indicated by the double circle symbols.
@peterle4672
2 жыл бұрын
This is the Myhill Nerode theorem
@user-yb5cn3np5q
Жыл бұрын
So what is the complexity of this algorithm? If you don't care, twice inverting arrows in DFA and converting resulting DFA to NFA gives you Brzozowski's algorithm. It can be implemented and explained in 5 minutes, the only catch is that it's running in exponential time. But if it doesn't only look like the video was supposed to describe efficient Hopcroft's algorithm, it failed.
Пікірлер: 25