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:
• Introduction to Languages, Strings, a...
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.
On this page of the site you can watch the video online Regular Languages: Deterministic Finite Automaton (DFA) with a duration of hours minute second in good quality, which was uploaded by the user lydia 22 April 2020, share the link with friends and acquaintances, this video has already been watched 97,488 times on youtube and it was liked by 4.1 thousand viewers. Enjoy your viewing!
