DFAs -- Intro Theory of Computation Help Session #1

This is a help session (called "recitations") about deterministic finite automata (DFAs), recorded on 18 January 2017. We go over how to make a DFA, as well as sample problems involving computation in a DFA.

Timestamps: 0:00 - Intro 1:20 - DFA Definition 6:51 - DFA Example 16:20 - DFA Construction Example 1 (at least three 0s) 21:20 - DFA Construction Example 2 (contains 010) 26:00 - DFA Construction Example 3 (binary numbers divisible by 5) 38:20 - DFA Construction Example 4 (odd number of 0s, even number of 1s)

Easy Theory Website: https://www.easytheory.org Become a member: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg/join Donation (appears on streams): https://streamlabs.com/easytheory1/tip Paypal: https://paypal.me/easytheory Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Merch: Language Hierarchy Apparel: https://teespring.com/language-hierarchy?pid=2&cid=2122 Pumping Lemma Apparel: https://teespring.com/pumping-lemma-for-regular-lang

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

▶SEND ME THEORY QUESTIONS◀ ryan.e.dougherty@icloud.com

▶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. ... https://www.youtube.com/watch?v=IteiVGIdFO4