Regular Languages: Deterministic Finite Automaton (DFA)

The finite state machine (also known as finite automaton) is the simplest computational model. This video covers the basics of finite state machines, and provides an introduction to deterministic finite automata (DFAs) and regular languages. _____________________ Additional resources: https://youtu.be/miOofcAiINM - My previous video on languages. I recommend watching it before this video. Michael Sipser. 2006. Introduction to the Theory of Computation (2nd. ed.). International Thomson Publishing. - The main source of my Theory of Computation knowledge (a textbook). Read Chapter 1.1: Finite Automata to learn more about regular languages and DFAs. _____________________ Again, this video project could not have been done without the support and guidance of Audrey St. John at Mount Holyoke College, a truly incredible professor-mentor-human.