7 - What is NFA? Rules & Examples | Theory of Automata and Formal Languages

In this seventh video, we introduce Nondeterministic Finite Automata (NFA) from scratch. We discuss what an NFA is, the specific rules for designing them, and how they differ from DFA. We will also solve several practice examples step-by-step so you can easily understand the difference in transitions and learn how to construct NFAs on your own. Note: This video is recorded in a mobile-friendly vertical format so you can easily watch it on your phone!