Are Regular Languages Closed under Infinite Union?
1,162 views
Why it's on BrighterTube
From a channel a BrighterTube curator approved in full · 80% confidenceFrom 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.
What you'll learn
A 5-minute video from Easy Theory's catalogue; the title names its topic.
Video by Easy Theory, played through YouTube's embedded player.