Context-Free Grammar for {0^n 1^n 2^m 3^m} U {0^n 1^m 2^m 3^n}
10,438 views
About this video
From a channel a BrighterTube curator vettedFrom 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.