Great explanation mam, I suggest by fellow friends who are watching this video that before watching this video firstly watch the video of Neso Academy on CFG to PDA conversion and also the PDA one so that you can better understand the numerical over here...
there are 7 tuples in PDA which accepts string by entering in final state, so we need 7 tuples(Q,singma,gamma,delta,q0,z0,F). but PDA that accepts string by empty stack do not worries about state.(it can be in any state) all it requires is string must be consumed and stack must be empty, so we can neglect F from tuples
ma'am, i looked many professionally explained video with good graphics, but nothing helped me out, until I found this video.
Thank You so much ma'am
Great explanation mam, I suggest by fellow friends who are watching this video that before watching this video firstly watch the video of Neso Academy on CFG to PDA conversion and also the PDA one so that you can better understand the numerical over here...
Best video for this content.😃 Nicely understand the conversion 👍
hi naveen 🤣🤣
@@shivom6116 😂😂
Bhai easy to ye but srf isi question ke liye mixup ke liye nh horha
This video helped me pass my final. Thank you!
best video so far!!!
solid content maam, this is what i was searching for ,it's superb
you are really greate, greate teacher , greate explination, thank you so much
Perfect explanation
Thank you ma'am for such lecture ❤❤❤
SUPERBLY EXPLAINED...!
Thanks a lot for this clear explanation ❤️👍
Thanks for good video prepared
Very nice explanation madam thank you🙏🙏🙏
Best teacher
you are a life saver
Thank you very much, ma'am.
Great explain
Thank you so much ma'am 😌❤
Actually the best video in it's respect
Yeahhhh madam thank you
Pronounce A PERFECTLY 😂
You listen your class first , then no need to see this
thanks, you help me sho much
Don't we want to convert CNF to GNF first,.....
? Where we convert tree? Plzz explain
Do you know if we should check that , give cfg is in gnf form ?
Don't trust Google do what is asked in question
S->aSbb|a,S->aSA|a,A->bB,B->b how to construct PDA for this CFG ?
Plz
Mam in pda they have 7 tuples but u explain only 6?? Plz explain
there are 7 tuples in PDA which accepts string by entering in final state, so we need 7 tuples(Q,singma,gamma,delta,q0,z0,F). but PDA that accepts string by empty stack do not worries about state.(it can be in any state) all it requires is string must be consumed and stack must be empty, so we can neglect F from tuples
Thank you so much mam
Gramer should be in gnf than we can convert but here
What if the string not given please anyone answer 😢
how to draw the npda diagram for the constucted npda?????? please answer ............ upvote
I'm searching for this video since 2 days
It just took me 1 minute. ha ha ha
Nice work
@@manideepakula4195 em kathal ra ivvi manideep!!!!!!!!!!
Idhekada mass chatting ra mawa 😹
@@manideepakula4195 mamulga vundadu mari 😂😂
Mam shud we check if cfg is in gnf?
yeah yeah .. thanks :D
yes and yay
Thank you
nice
Clearly Understood
It's cfg to pda ryt
Yeah
s not yes
nice