NFA to Regex Conversion Example #1, "Simple" (GNFA Method)

From a channel Lumen includes in full: Easy Theory, by CS lecturer Ryan Dougherty, works complete proofs and examples in automata theory, computability and complexity — DFAs, pumping lemma, Turing machines, NP-completeness reductions — at university-course depth.

A 15-minute video from Easy Theory's catalogue; the title names its topic.

Video by Easy Theory, played through YouTube's embedded player.