Verifying Addition is Regular (Sipser Problem 1.32 Solution) - Easy Theory
3,110 views
About this video
From a channel a BrighterTube curator vetted · 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.
A 16-minute video from Easy Theory's catalogue; the title names its topic.
Video by Easy Theory, played through YouTube's embedded player.
Part of Sipser Textbook Solutions - Easy Theory, Nondeterministic Finite Automata (NFAs) - Easy Theory