Thank you so much for your explanation. I have watched so many otheer videos but not so good as yours. Great job!! Now i can go to my exam fully prepared thanks to you..!!
Everything seems OK but you please take care when you say that for t13 there are only 2 cases. To know all the cases you must account for all the possible combination that leads to the sum of 3( length of string at t13) which are (3), (1,2), (2,1) now you derive the production which leads to them you will find that the possibility of deriving all 3 in order is 0 as no production will be able to derive ' aab' at once. But say if any production which derives AAB OR AAC( AAB and AAC are possible ways to reach aab (taken whole) at once but since no production derives them they are rejected ) is there then by your approach you will miss one production for t13
but in the starting it was assumed that the given grammar is always in CNF, so there's no point of having a production which derives "AAB or AAC" or any other as quoted by you
really helpful!! I learnt this problem today morning with your help and in the afternoon I wrote my semester exam very well ;) this problem was given for 10 marks, thank you so much madam.
The best!!! Very clear explanation. Thank you, Madam!
After this i wanna sue my teacher
Thank you so much for your explanation. I have watched so many otheer videos but not so good as yours. Great job!! Now i can go to my exam fully prepared thanks to you..!!
I was struggling a lot until i found this. thanks mam a lot for such crystal clear explanation and keep up the good work
You're a goddess. My exam is in 2 hours and I finally understood this
Superb mam
Everything seems OK but you please take care when you say that for t13 there are only 2 cases. To know all the cases you must account for all the possible combination that leads to the sum of 3( length of string at t13) which are (3), (1,2), (2,1) now you derive the production which leads to them you will find that the possibility of deriving all 3 in order is 0 as no production will be able to derive ' aab' at once. But say if any production which derives AAB OR AAC( AAB and AAC are possible ways to reach aab (taken whole) at once but since no production derives them they are rejected ) is there then by your approach you will miss one production for t13
but in the starting it was assumed that the given grammar is always in CNF, so there's no point of having a production which derives "AAB or AAC" or any other as quoted by you
Very Nice
Thank you so much mam. It is very helpful for me.. awesome explanation
So impressive thank you so so much!!!
awesome and clear, thank you
really helpful!! I learnt this problem today morning with your help and in the afternoon I wrote my semester exam very well ;) this problem was given for 10 marks, thank you so much madam.
Your notes are always helpful. Best way of teaching you have got there. Keep it up!!
I have a doubt if the top block contains other non terminals and not the start symbol then whether the string is accepted or not?
You are awesome !!!
Thanks for making this video. It contained a very good example with a great explanation
Thank you!!!!! Great Video explaining CYK algorithm!!!!
Pretty much clear than rest of the videos, thankyou, ma'am!!
Queen
wonderful wonderful wonderful wonderful wonderful wonderful wonderful wonderful
Great explanation....
Thank you so much Ma'am ❤️❤️ It's very helpful and your voice is too sweet ❤️
Lots of love from University of Leeds
Supper supper supper
i love
very very good explanation
is AC=CA?
thank you. very simple and clear.
Amazing, thank you!
Thank you ma'am for this awesome video.Also Thanks Vishaka for suggesting :)
@@soumyaranjanram6536 lol
@@vishakamohan5336 topper :')
Nice explanation ma'am
Very nice explanation. Thank you for the video 8:42
THANKS!! Very well explained
Super explanation maam, tqsm🥰
madam u r jst awesome.this helps me a lot.thanks again
You are amazing
Thanks a lot ma'am that was the easiest method
Simply Awesome!!!!!
Simple yet perfect explanation. Thank you ma'am. You covered all the cases in this example.
Really good explained, Thank you!
😍😍😘
🤩🤩
thank you mam understood clearly
Lots of love from Harvard university ❤️
Nice explanation!!
💕💕💕💕💕💕
thanks
❤❤❤❤❤❤❤
if we have a string with lenght 5 then how to find the t15
Awesome, thanks!
very welll explained
Awesome explanation mam...
very well explained mam
Thanks You very much mam....
It hepls me A lot
Excellent tutorial madam.
Great tutorial
great tutorial, great help!!.
nice explanation
thank uu😘😘
Thanks alot
good expatiation..
good one. very simple explanation
Thank You Ma'am!
Thanks a lot ma'am...
very good tutorial , thanks......
Video is rotated
Thankuu mam😍
Thank you so much mam
Nice
helpful
Thanks akkoooo
Thanxx mam
Thank u mam....
thanks ma'am
nice
Thankyou mam 👏
thanku ma'am
8.45
8:46
Thanks, mam. Great explanation.
thanks mam
thank you :D
Awesome but could you please teach pushdown automata and dfa to re using state elimination technique
thanks alot
Great explanation...