Deterministic Finite Automata 2

This video continues our discussion of DFA's, setting up the connection between finite automata and sets of strings to define "regular sets." 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.

[victorli]

I just want to thank you for uploading such amazing lectures about computation theory!