Automata & Simple Machines | ToC 2019 Lecture #1

Full Theory of Computation Lecture playlist: https://www.youtube.com/watch?v=OPaB-rpKhZ0&list=PLylTVsqZiRXMiTARmrsxCWU2RahyKB_Ae&index=1&t=1s
Lecture "a la carte" playlist: https://www.youtube.com/watch?v=gO9Ho9Dpu8k&list=PLylTVsqZiRXP51EfJWv8cxD6wIFTZQD9_&index=1

Here we go over the syllabus and discuss finite automata + their motivation, including giving a formal definition and examples.

Timeline:
0:00 - Syllabus (Part 1 start)
30:28 - Motivation for Computer Science Theory
37:00 - Reducing Number of Inputs/Outputs to 1
49:14 - Part 2
50:30 - Simple Machine Example
57:30 - Sample Computation on 000
1:03:25 - More Complicated Example
1:13:45 - Deterministic Finite Automaton Formal Definition
1:26:30 - Formalizing an Example DFA
1:33:30 - More Definitions (Kleene Star, Alphabet, Language)

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

#easytheory

Youtube Live Streaming (Sundays) - subscribe for when these occur.

Social Media:
Facebook Page: https://www.facebook.com/easytheory/
Facebook group: https://www.facebook.com/groups/easytheory/
Twitter: https://twitter.com/EasyTheory

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.