After finishing my final exam I had to search this up again just to say thanks, you have no idea how many videos I've seen or how my professor explained that part yet it was just vague, and out of all of these videos I've seen you are by a wide margin, the best. Don't let your view count trick you; what you are doing is very impressive and amazing.
Oh, it could potentially be minimized, for sure! In fact, DFA minimization technically gives us a way to algorithmically check that two DFA's accept the same language: do the product construction for "M if and only if N", remove inaccessible states, and minimize---the DFA's are equivalent just when the result is a one-state DFA accepting everything!
After finishing my final exam I had to search this up again just to say thanks, you have no idea how many videos I've seen or how my professor explained that part yet it was just vague, and out of all of these videos I've seen you are by a wide margin, the best. Don't let your view count trick you; what you are doing is very impressive and amazing.
Thanks, this makes them worth it!
Perfect explanation, amazing animations that makes things clear. Thanks.
Thanks! I'll hope to get the Subset Construction one up in January and finish up the DFA/NFA set of videos.
The animation was very helpful! Thank you. :)
This is such a good video so deserves more views and likes
Thanks! Hoping to get a few others (RegExp to and from NFA, etc.) up this summer!
omg 10/10 proof i hope there's more of those
This video is great, thanks
so there are n cross m states in final dfa. or we can minimize it?
Oh, it could potentially be minimized, for sure!
In fact, DFA minimization technically gives us a way to algorithmically check that two DFA's accept the same language: do the product construction for "M if and only if N", remove inaccessible states, and minimize---the DFA's are equivalent just when the result is a one-state DFA accepting everything!