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..!!
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.
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
The best!!! Very clear explanation. Thank you, Madam!
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..!!
you seem old enough to be my mommy.. id like that
I was struggling a lot until i found this. thanks mam a lot for such crystal clear explanation and keep up the good work
After this i wanna sue my teacher
Your notes are always helpful. Best way of teaching you have got there. Keep it up!!
Thank you so much mam. It is very helpful for me.. awesome explanation
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?
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.
Very nice explanation. Thank you for the video 8:42
Thanks for making this video. It contained a very good example with a great explanation
Superb mam
Pretty much clear than rest of the videos, thankyou, ma'am!!
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
Thank you!!!!! Great Video explaining CYK algorithm!!!!
You are awesome !!!
Thank you so much Ma'am ❤️❤️ It's very helpful and your voice is too sweet ❤️
So impressive thank you so so much!!!
Amazing, thank you!
Thank you ma'am for this awesome video.Also Thanks Vishaka for suggesting :)
@@soumyaranjanram6536 lol
@@vishakamohan5336 topper :')
awesome and clear, thank you
is AC=CA?
Super explanation maam, tqsm🥰
Very Nice
THANKS!! Very well explained
Simple yet perfect explanation. Thank you ma'am. You covered all the cases in this example.
Really good explained, Thank you!
madam u r jst awesome.this helps me a lot.thanks again
if we have a string with lenght 5 then how to find the t15
Nice explanation ma'am
very very good explanation
Nice explanation!!
You are amazing
thank you. very simple and clear.
Awesome explanation mam...
Thanks a lot ma'am that was the easiest method
wonderful wonderful wonderful wonderful wonderful wonderful wonderful wonderful
thank you mam understood clearly
very well explained mam
Excellent tutorial madam.
Simply Awesome!!!!!
great tutorial, great help!!.
good one. very simple explanation
Lots of love from University of Leeds
very welll explained
Queen
nice explanation
Great tutorial
Awesome, thanks!
Thanks You very much mam....
Thanks a lot ma'am...
good expatiation..
i love
very good tutorial , thanks......
Thank You Ma'am!
8:46
Supper supper supper
thanks
thank uu😘😘
Thank you so much mam
Lots of love from Harvard university ❤️
It hepls me A lot
Thanks akkoooo
Video is rotated
😍😍😘
Thankyou mam 👏
You're a goddess. My exam is in 2 hours and I finally understood this
Thankuu mam😍
thanks alot
Thanxx mam
Thank u mam....
thanks ma'am
Nice
thanku ma'am
thank you :D
💕💕💕💕💕💕
helpful
🤩🤩
❤❤❤❤❤❤❤
thanks mam
nice
Thanks, mam. Great explanation.
Great explanation...
8.45
Awesome but could you please teach pushdown automata and dfa to re using state elimination technique
Great explanation....
Thanks alot