Pumping Lemma (For Context Free Languages)

  Рет қаралды 696,472

Neso Academy

Neso Academy

Күн бұрын

Пікірлер: 86
@isukim2267
@isukim2267 4 жыл бұрын
This 8 minutes lecture is far better than my 1 hour professor lecture. Thanks a lot.
@jaxxmason5081
@jaxxmason5081 3 жыл бұрын
@Hendrix Quinton Yup, been watching on Flixzone for since november myself :)
@aresadam4807
@aresadam4807 3 жыл бұрын
@Hendrix Quinton Yea, I've been watching on flixzone for months myself :D
@prashantyadav1703
@prashantyadav1703 3 жыл бұрын
Concentration matter brother
@Stefan-dg2js
@Stefan-dg2js Жыл бұрын
so true, most professors seem to hate giving lectures
@VigneshVicky-en8su
@VigneshVicky-en8su Жыл бұрын
Absolutely right 👍❤
@lucamazzucco2672
@lucamazzucco2672 4 жыл бұрын
Thank you so much for making these videos. Tomorrow we have an exam and we will watch yours video until morning, you have really saved our asses.
@JustwaitNwatch-w
@JustwaitNwatch-w 8 ай бұрын
Hope your ass is still safe after 4 years 😂
@Quran_ver
@Quran_ver 3 ай бұрын
@@JustwaitNwatch-w oh i think you are also here to save yours
@JustwaitNwatch-w
@JustwaitNwatch-w 3 ай бұрын
@@Quran_ver of course dude 🤣
@JustwaitNwatch-w
@JustwaitNwatch-w 3 ай бұрын
@@Quran_ver my ass was not saved but after rechecking the marks i was passed in this stupid subject
@desertsage6825
@desertsage6825 7 жыл бұрын
This is great. You are amazing. Never understood this with my professor's slides.
@nirdeshpathak4332
@nirdeshpathak4332 2 жыл бұрын
That's because you never paid attention
@magicmelody3632
@magicmelody3632 Жыл бұрын
@@nirdeshpathak4332 bruh!! he paid enough attention to this subject that's why he came here to understand the topic ! you dumb or wot?😒😒
@dominikprager5338
@dominikprager5338 Жыл бұрын
@@nirdeshpathak4332 That's such a cap
@Rajveer__singhhhh
@Rajveer__singhhhh 10 ай бұрын
Neso academy is not good channel it is one of the best channel for TOC
@krunaldhavle2020
@krunaldhavle2020 5 жыл бұрын
thank you so much for every video of toc i reallly appriciate your work man.we are much more better than my teacher.i am watching your video for my toc paper.thank you so much you just saved me from failing.
@NinjaGodIvan
@NinjaGodIvan 5 жыл бұрын
I learn more from watching KZbin videos than my four years in college. Pretty much, you can replay the videos if you ever have a hard time understanding.
@ThePriyeshpandey
@ThePriyeshpandey 4 жыл бұрын
I'm a non cs student, and never studied CS cncepts in college, but youtube videos pretty much covers it all
@mayiwang
@mayiwang 6 жыл бұрын
You said if the 3 conditions are true then it is a context free language. That’s not necessarily the case. The claim is that IF a language is context free then the pumping lemma must hold for that language. It is possible for a non context free language to have those properties.
@abhigyanraha5620
@abhigyanraha5620 6 жыл бұрын
this is correct
@kelvinvu1247
@kelvinvu1247 6 жыл бұрын
right, basically you need to find a contradiction for ALL 3 conditions based off a string S, to prove it is not context free
@blakefeucht960
@blakefeucht960 6 жыл бұрын
@@kelvinvu1247 No this is not true. If any, not all, of the three conditions are violated, it is not a context free language. What OP is saying is correct and is not the same as what you are saying. Essentially, these 3 conditions are necessary but not sufficient for proving a language is context free, they can only show you definitively that a language is NOT context free.
@omeshdewangan3352
@omeshdewangan3352 5 жыл бұрын
method of understand is very well. full personalizims. thanks sir
@dfsafdsafsvgdf
@dfsafdsafsvgdf 3 жыл бұрын
thank you so much!, i hope that will help me to pass my exam tomorrow!
@er.iqbalsingh8382
@er.iqbalsingh8382 3 жыл бұрын
You will bro...BEST OF LUCK...
@MrAdamkimbo
@MrAdamkimbo 4 жыл бұрын
Thank you for this; it's very helpful!
@najeebashah76
@najeebashah76 4 жыл бұрын
1. Let L be the language {a^i b^i c^ / 0
@kabeer3176
@kabeer3176 2 жыл бұрын
Before i am struggling to pass now i am struggling to top 👍❤️
@merajmalik1884
@merajmalik1884 5 жыл бұрын
thank you so much for every video of toc i reallly appriciate your work man.we are much more better than my teacher.i am watching your video for my toc paper.thank you
@martinabelcapo2406
@martinabelcapo2406 5 жыл бұрын
Thank you! Well explained!
@karankurali4800
@karankurali4800 2 жыл бұрын
thank you sir
@tejaspandit2551
@tejaspandit2551 3 жыл бұрын
Can we make a parse tree in pumping lemma for Context free language.
@rajasreesutrawe5833
@rajasreesutrawe5833 3 жыл бұрын
Nice explanation
@merajmalik1884
@merajmalik1884 5 жыл бұрын
thanks.well explained
@akkiirocker
@akkiirocker 7 жыл бұрын
Thanks for the tutorial 👍👍
@ThemisTheotokatos
@ThemisTheotokatos 4 жыл бұрын
Thank you. Where is the playlist from this video?
@nesoacademy
@nesoacademy 4 жыл бұрын
goo.gl/f4CmJw
@rexhinaldcuke4146
@rexhinaldcuke4146 4 жыл бұрын
What if there are 3 ways for the string to be divided and one of ways shows you can pump it while the other two don't? Is the language context free?
@razvanefros411
@razvanefros411 Жыл бұрын
if its pumpbable at least in one of the division possibilities then the contradiction proof fails. To understand this better you have to walk slowly through the thought process of the proof: We ASSUME that the language is pumpable. Therefore, it MUST HAVE a pumping length, call it P, so that ALL words longer than P MUST BE PUMPABLE. From here, we set to prove the contradiction: since our claim has led to saying ALL words longer than P are pumpable, it's enough to find One word that can't be pumped to prove the contradiction. If you picked a word and it turns out to be pumpable, you should try to find a different word that won't be; if you cant find one, it might be the case that the language is actually context free (it's not guaranteed, pumping lemma doesnt prove anything)
@todayinhistory4021
@todayinhistory4021 4 ай бұрын
3:52 is it necessary to write this steps in my university examination sir ??
@neEs6624
@neEs6624 Жыл бұрын
This is Amazing 😍
@bobobsen
@bobobsen Жыл бұрын
Thank you
@MyPrudhvi
@MyPrudhvi 6 жыл бұрын
CFL closed under concatnation is valid but L1={a^n, n>0} L2={b^nc^n, n>0} L1.L2={a^nb^nc^n} --> whic is not CFL Then How it is closed under CFL? Please help me........................
@ChristianBurnsShafer
@ChristianBurnsShafer 6 жыл бұрын
Well, instead of using the same index 'n' both times maybe using the index 'm' in L2 will make this more clear to you why the concatenation is still a CFL.
@malvikapathak4971
@malvikapathak4971 7 жыл бұрын
Please put all the vedios we are going to have our semester exams
@abdelrhmanahmed1378
@abdelrhmanahmed1378 7 жыл бұрын
why we divide her to 5 and what the intuition of that !?!
@zeeshan9321
@zeeshan9321 6 ай бұрын
TOMORROW IS MY EXAM
@devmahad
@devmahad Жыл бұрын
Thanks - Done
@Itachiuchiha-dz1ld
@Itachiuchiha-dz1ld 6 ай бұрын
,./';
@dhanushsivajaya1356
@dhanushsivajaya1356 3 жыл бұрын
Thankyou sir
@ProfessionalTycoons
@ProfessionalTycoons 6 жыл бұрын
amazing video.
@AhamedKabeer-wn1jb
@AhamedKabeer-wn1jb 3 жыл бұрын
Thank you..
@iabukai
@iabukai 6 жыл бұрын
index : also called : Bar-Hillel lemma
@marxman1010
@marxman1010 3 жыл бұрын
Step 6 and 7 are in wrong order. Firstly should find ways of dividing as uvxyz, then consider some strings divided in that way not belong to A.
@biswarupprasadbose953
@biswarupprasadbose953 7 жыл бұрын
Plz show an example....
@exoticme4760
@exoticme4760 5 жыл бұрын
Thnku
@maheshpasare4975
@maheshpasare4975 7 жыл бұрын
prove by example
@perfectcs1437
@perfectcs1437 3 жыл бұрын
actually you should explain with an example
@259_parthpatidar9
@259_parthpatidar9 3 жыл бұрын
actually you should watch full video, he said in next lecture
5 жыл бұрын
WEEEEEEE NEEEEEEEEEEED EXXXXXXXXXXAAAAAMMMMPLEEESSSSSSS
@spag5296
@spag5296 5 жыл бұрын
This channel does an example video, as a follow up to this video. kzbin.info/www/bejne/m4KTiZ6LoJikfc0
@krishyadav4751
@krishyadav4751 5 жыл бұрын
you need to get out of weed.
@testphp667
@testphp667 4 жыл бұрын
check abc
@yoggjoshi07
@yoggjoshi07 15 күн бұрын
SAVIOUR FR.
@zuliapr6105
@zuliapr6105 6 жыл бұрын
mantul mantab betul
@phoenixra04
@phoenixra04 6 жыл бұрын
pasti mau kuis ya
@angosomcs9427
@angosomcs9427 5 жыл бұрын
wawwwww
@willingtushar
@willingtushar 7 жыл бұрын
your voice is not good as I have to listen to it all the time. so please give it a look
@adityaprakash3860
@adityaprakash3860 7 жыл бұрын
chutiya
@apostolosmavropoulos177
@apostolosmavropoulos177 7 жыл бұрын
WOULD it be good if u didn't have to listen to it all the time??you really make no sense....
@ravigupta-ek7mi
@ravigupta-ek7mi 6 жыл бұрын
What a douche
@mihirpatel4392
@mihirpatel4392 6 жыл бұрын
Just saw a few seconds of your Li Fi presentation, looked like a fucking fourth grader made it
@MrCmon113
@MrCmon113 6 жыл бұрын
He's from India...
Pumping Lemma (For Context Free Languages) - Examples (Part 1)
12:22
Pumping Lemma (For Regular Languages)
8:08
Neso Academy
Рет қаралды 1,3 МЛН
Don't underestimate anyone
00:47
奇軒Tricking
Рет қаралды 24 МЛН
Кто круче, как думаешь?
00:44
МЯТНАЯ ФАНТА
Рет қаралды 6 МЛН
The IMPOSSIBLE Puzzle..
00:55
Stokes Twins
Рет қаралды 189 МЛН
Pumping Lemma (For Context Free Languages) - Examples (Part 2)
17:44
Pumping Lemma for Context-Free Languages: Four Examples
48:49
Easy Theory
Рет қаралды 56 М.
Theory of Computation: Pumping Lemma for Regular Languages
12:33
Context Free Grammar & Context Free Language
7:52
Neso Academy
Рет қаралды 1,4 МЛН
CFG to GNF Conversion (Removal of Left Recursion)
11:20
Neso Academy
Рет қаралды 715 М.
pumping lemmafor CFL | TOC | Lec-75 | Bhanu Priya
8:53
Education 4u
Рет қаралды 152 М.
Context-Free Grammar to Pushdown Automaton Conversion (CFG to PDA)
9:15
Don't underestimate anyone
00:47
奇軒Tricking
Рет қаралды 24 МЛН