Skip to content

Pumping Lemma for Regular Languages Example: 0^n 1^m (n is less than 3m)

Easy Theory40.8K subscribers

4,570 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 Pumping Lemma Proofs (Regular + Context-Free) - Easy Theory