Skip to content

Emptiness for DFAs is Decidable

Easy Theory40.8K subscribers

6,366 views

About this video

From a channel a BrighterTube curator vetted

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.

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

Part of Decidable Languages - Easy Theory, "Intro" Theory of Computation Lectures - Easy Theory