Ogden's Lemma for Context-Free Languages Proof

7,172 views

About this video

From a channel a BrighterTube curator vetted · 80% confidence

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 20-minute video from Easy Theory's catalogue; the title names its topic.

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

Part of Advanced Theory of Computation - Easy Theory, Pumping Lemma Proofs (Regular + Context-Free) - Easy Theory