This 8 minutes lecture is far better than my 1 hour professor lecture. Thanks a lot.
@jaxxmason50813 жыл бұрын
@Hendrix Quinton Yup, been watching on Flixzone for since november myself :)
@aresadam48073 жыл бұрын
@Hendrix Quinton Yea, I've been watching on flixzone for months myself :D
@prashantyadav17033 жыл бұрын
Concentration matter brother
@Stefan-dg2js Жыл бұрын
so true, most professors seem to hate giving lectures
@VigneshVicky-en8su Жыл бұрын
Absolutely right 👍❤
@lucamazzucco26724 жыл бұрын
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-w8 ай бұрын
Hope your ass is still safe after 4 years 😂
@Quran_ver3 ай бұрын
@@JustwaitNwatch-w oh i think you are also here to save yours
@JustwaitNwatch-w3 ай бұрын
@@Quran_ver of course dude 🤣
@JustwaitNwatch-w3 ай бұрын
@@Quran_ver my ass was not saved but after rechecking the marks i was passed in this stupid subject
@desertsage68257 жыл бұрын
This is great. You are amazing. Never understood this with my professor's slides.
@nirdeshpathak43322 жыл бұрын
That's because you never paid attention
@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 Жыл бұрын
@@nirdeshpathak4332 That's such a cap
@Rajveer__singhhhh10 ай бұрын
Neso academy is not good channel it is one of the best channel for TOC
@krunaldhavle20205 жыл бұрын
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.
@NinjaGodIvan5 жыл бұрын
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.
@ThePriyeshpandey4 жыл бұрын
I'm a non cs student, and never studied CS cncepts in college, but youtube videos pretty much covers it all
@mayiwang6 жыл бұрын
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.
@abhigyanraha56206 жыл бұрын
this is correct
@kelvinvu12476 жыл бұрын
right, basically you need to find a contradiction for ALL 3 conditions based off a string S, to prove it is not context free
@blakefeucht9606 жыл бұрын
@@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.
@omeshdewangan33525 жыл бұрын
method of understand is very well. full personalizims. thanks sir
@dfsafdsafsvgdf3 жыл бұрын
thank you so much!, i hope that will help me to pass my exam tomorrow!
@er.iqbalsingh83823 жыл бұрын
You will bro...BEST OF LUCK...
@MrAdamkimbo4 жыл бұрын
Thank you for this; it's very helpful!
@najeebashah764 жыл бұрын
1. Let L be the language {a^i b^i c^ / 0
@kabeer31762 жыл бұрын
Before i am struggling to pass now i am struggling to top 👍❤️
@merajmalik18845 жыл бұрын
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
@martinabelcapo24065 жыл бұрын
Thank you! Well explained!
@karankurali48002 жыл бұрын
thank you sir
@tejaspandit25513 жыл бұрын
Can we make a parse tree in pumping lemma for Context free language.
@rajasreesutrawe58333 жыл бұрын
Nice explanation
@merajmalik18845 жыл бұрын
thanks.well explained
@akkiirocker7 жыл бұрын
Thanks for the tutorial 👍👍
@ThemisTheotokatos4 жыл бұрын
Thank you. Where is the playlist from this video?
@nesoacademy4 жыл бұрын
goo.gl/f4CmJw
@rexhinaldcuke41464 жыл бұрын
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 Жыл бұрын
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)
@todayinhistory40214 ай бұрын
3:52 is it necessary to write this steps in my university examination sir ??
@neEs6624 Жыл бұрын
This is Amazing 😍
@bobobsen Жыл бұрын
Thank you
@MyPrudhvi6 жыл бұрын
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........................
@ChristianBurnsShafer6 жыл бұрын
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.
@malvikapathak49717 жыл бұрын
Please put all the vedios we are going to have our semester exams
@abdelrhmanahmed13787 жыл бұрын
why we divide her to 5 and what the intuition of that !?!
@zeeshan93216 ай бұрын
TOMORROW IS MY EXAM
@devmahad Жыл бұрын
Thanks - Done
@Itachiuchiha-dz1ld6 ай бұрын
,./';
@dhanushsivajaya13563 жыл бұрын
Thankyou sir
@ProfessionalTycoons6 жыл бұрын
amazing video.
@AhamedKabeer-wn1jb3 жыл бұрын
Thank you..
@iabukai6 жыл бұрын
index : also called : Bar-Hillel lemma
@marxman10103 жыл бұрын
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.
@biswarupprasadbose9537 жыл бұрын
Plz show an example....
@exoticme47605 жыл бұрын
Thnku
@maheshpasare49757 жыл бұрын
prove by example
@perfectcs14373 жыл бұрын
actually you should explain with an example
@259_parthpatidar93 жыл бұрын
actually you should watch full video, he said in next lecture