Buy Dideo Subscription
Playlist for all videos on this topic: https://www.youtube.com/playlist?list=PLXVjll7-2kRnMt3PCXLAbK2rDh-27t4o8 a^nb^nc^n is not context free not regular, {a^n b^n c^n}, which is not context-free, Pumping Lemma, turing machine can do Matching, Theory of Computation, Automata Theory, gate, iit, lectures, tutorial, in hindi, pumping lemma to prove that languages are not regular using the example language a^n b^n Pumping lemma example: a^n b^n is not a regular language Closure Properties Union L1 is CFL, L2 is CFL, is L1 U L2 CFL? Example: L1 palindrome Concatentation L1 is CFL, L2 is CFL, is L1L2 CFL? Kleene starL1 is CFL is L1* a CFL? Intersection L1 is CFL, L2 is CFL, is L1 /\ L2 CFL?
