The Product Construction for DFA's

This video presents the Product Construction for DFA's, which allows us to show that the union or intersection of two regular sets is regular by, in essence, running two DFA's at the same time. It can move quickly, so please pause and rewind as necessary!

Thanks to Amy Briggs (Middlebury College) for introducing me to this material, as well as Dexter Kozen (Cornell University) for the text that we used and Wayne Goddard (Clemson University) for the additional perspective provided by his text.

[OK-rieu]

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.

[mwarrock]

Perfect explanation, amazing animations that makes things clear. Thanks.

[archieb]

The animation was very helpful! Thank you. :)

[lydiaalexian]

omg 10/10 proof i hope there's more of those

[FluffyBuffy]

This is such a good video so deserves more views and likes

[adityakishore]

so there are n cross m states in final dfa. or we can minimize it?