Regular Languages: Nondeterministic Finite Automaton (NFA)

How are nondeterministic finite automata (NFAs) different from DFAs? This video provides an introduction to NFAs, also one of the simple computational models and another kind of finite state machine. ____________________ Additional resources: https://youtu.be/PK3wL7DXuuw - My previous video on finite state machines and DFAs. Understanding what finite state machines are exactly will be very helpful in learning about NFAs! https://youtu.be/miOofcAiINM - I made a video on languages if you don't know what languages are. 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.2: Nondeterminism to learn more about NFAs. _____________________ And as always, 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.