DFA Example: Binary Multiples of n (Sipser 1.37 Solution)

Here we solve problem 1.37 of Sipser, which asks for a deterministic finite automaton (DFA) for all binary multiples of n, for each integer n.
Thanks to the following supporters of the channel for helping support this video. If you want to contribute, links are below. Names are listed in alphabetical order by surname.
Platinum: Micah Wood
Silver: Simone Glinz, Timmy Gy, Josh Hibschman, Patrik Keinonen, Travis Schnider, and Tao Su
Easy Theory Website: www.easytheory...
Become a member: / @easytheory
Donation (appears on streams): streamlabs.com...
Paypal: paypal.me/easy...
Patreon: / easytheory
Discord: / discord
Merch:
Language Hierarchy Apparel: teespring.com/...
Pumping Lemma Apparel: teespring.com/...
If you like this content, please consider subscribing to my channel: / @easytheory
▶SEND ME THEORY QUESTIONS◀
[e-mail]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

[@AA-xb4mx]

Thank you so much for this!!!

[@sudarshanv9797]

Thanks for doing videos on theory of computation, really hard to find quality ToC content on TH-cam.

[@AntonioTagliente-pf2ni]

The best explanation ever! Easy

[@illeone5433]

It's really hard putting this into regex and figuring out how it works.