The videos below highlight excerpts from the book Foundations of Computing: An Accessible Introduction to Formal Languages.
Shows how to convert a non-deterministic finite automaton (NFA) to a deterministic one (DFA) in a straightforward, visual manner.
Shows how to account for lambda transitions when converting an NFA to a DFA.