I just wanna say that I've spent my afternoon with your videos and I think I learned more in these couple of hours than I did for the whole semester... The way you teach is simply amazing. Thank you and greetings from Germany!
I have been following this channel past two years. All I want to say is thank you so much for guiding me through various subjects. I have scored really well in whatever subjects you've taught me!!!
I have seen almost every lecture of toc Its very helpful for learning and getting understand to toc topics this is the best channel of RUclips for studying toc I explore many channel and waste the time but you neso academy you are the best
The level of questions this Channel uses is absolutely great.. I have seen many videos of this topic but the question they take were very basic.. which obviously didn't clear whole concept..
Sir please upload remaining lectures. I'm totally dependant on your lectures. My exams starts from 12 May. Because of you I was able to pass DLD in last semester. All the students are waiting for your lectures. Please it's a sincere request upload it ASAP!
yours lecture really helps me to understand theory of automation plz upload all remaining videos which is about PDA and turing machine plz upload alls BCOZ MY paper coming soon please understand problem thanks for giving me a such lecture to understand CNF
When we convert a given CFG to CNF. The following simplification order must be followed strictly: 1. Elimination of Null Productions (Epsilon Productions) 2. Elimination of Unit Productions 3. Elimination of useless Symbols (useless Productions) Then the remaining process will be very Easier.
Sir,In the removing unit production of S'->S at 7:17 You've replaced S' by the value of S but in the lecture of removing unit productions you have stated that you have to replace A->B by A->x whenever B->x in the Grammer and x belongs to terminals, but Here in S'->S ,S contains both terminals and non terminals
@JAY prakash sorry to say but u are wrong, think if S' wants to go to another option or a non terminal Symbol like AS but in your case you are restricting S' to go only to a terminal symbol a.
@snehal machan Go step by step , first add S'->S (coz S is on the right hand side) then it becomes a case of unit production and after that remove the unit production and also remove more than 2 non terminals.
at 7:37, S'->a (only this should have happened) because S->a; here 'a' is the only terminal and only the terminals and null are replaced in unit productions as told *in video 76 at 1:18*. Also change on removing A->S So, the result on removing all unit productions should be :- S' -> a, S -> ASA | aB | a | AS | SA, A -> b | a, B -> b
wow it was great to extract the concept from your videos . hope to see yuh in the upcomming days with new more conceptual videos . thanking you from NEPAL............
Hi sir, please upload remaining lectures about PDA and Turing machines. the way you explaining is in simple manner understandable. waiting for your next videos
Thank you for these videos sir. plz upload rest of the topic videos which are turing machine, push down automata etc soon. It'll be really helpful for us. Thank you so much for this great help.
11:08; i thought rather than introducing new production Y -> a, we can use A->a, but that would also allow other productions of A which we don't want. that's why we introduce Y that only goes to a and nothing else.
sir pls upload more and more videos on this subject as early as possible I am completely dependent on your videos my syllabus for this paper is upto turing machine pls help me
Please ,please🙏🙏 please complete the Theory of Computation course.Please upload videos of rest of the topics and their examples i.e., PDA and Turing machine I have semester exams from 2nd week of next month. Please upload. NESO ACADEMY has helped me a lot in getting good marks in my previous semester. Please help.
neso bhai saare subjects ke videos daalo. mai vit mai hu humare college mai sare bacche neso se hi padhte hai. please aur bhi subjects daalo. vit mai pata karo aur konse subjects hai unki bhi video daalo.
I just wanna say that I've spent my afternoon with your videos and I think I learned more in these couple of hours than I did for the whole semester... The way you teach is simply amazing. Thank you and greetings from Germany!
Same here as well from Malaysia!
Exactly! In one night I have learned and understood all the things that I couldn't understand during the semester. And I have passed the exam :)
same here, from India
You are from germany?
Same Bangladesh
I have been following this channel past two years. All I want to say is thank you so much for guiding me through various subjects. I have scored really well in whatever subjects you've taught me!!!
This Academy is litrelly saving lives of many students 😭...
All I wanna do is Thank You🙏
Please upload the rest of the videos asap.You are doing a huge service to mankind by making these videos.
I have seen almost every lecture of toc Its very helpful for learning and getting understand to toc topics this is the best channel of RUclips for studying toc I explore many channel and waste the time but you neso academy you are the best
i have no words for the way you explain a topic .... its like learning from the topic itself... great respect whoever you are
The level of questions this Channel uses is absolutely great..
I have seen many videos of this topic but the question they take were very basic.. which obviously didn't clear whole concept..
Very helpful, these lectures are getting me through my theory of computation class.
Saaaame!!!
@@YuNgHaSaN same
@evanlecarde281 Same
At 1:27, the first step S'->S doesn't conform to chomsky normal form, since S is not in T. But disappear in step 3.
Sir please upload remaining lectures. I'm totally dependant on your lectures. My exams starts from 12 May. Because of you I was able to pass DLD in last semester. All the students are waiting for your lectures. Please it's a sincere request upload it ASAP!
Bhai job lag gayi kya?
@@Arham__Qasim haan ji bhai, job lag gyi hai
@@abhishekbalyan7189 congrats🥳
yours lecture really helps me to understand theory of automation
plz upload all remaining videos which is about PDA and turing machine
plz upload alls
BCOZ MY paper coming soon
please understand problem
thanks for giving me a such lecture to understand CNF
yes sir I agree Prince
yes true....we are waiting for those of turing Machine
actually we can't wait
ya plz my xams are coming plz upload them fast and thanx for teaching in such a great way....
Please treat teacher as Sir, sir. I dont understand problem
Thank you so much for this great explanation , understood fully.
You are born to teach.
When we convert a given CFG to CNF. The following simplification order must be followed strictly:
1. Elimination of Null Productions (Epsilon Productions)
2. Elimination of Unit Productions
3. Elimination of useless Symbols (useless Productions)
Then the remaining process will be very Easier.
Cristal clear explanation sir💀.. thank you soo much.. ur vedios r our all time saviours.
Sir,In the removing unit production of S'->S at 7:17
You've replaced S' by the value of S but in the lecture of removing unit productions you have stated that you have to replace A->B by A->x whenever B->x in the Grammer and x belongs to terminals, but Here in S'->S ,S contains both terminals and non terminals
ya i think it should be S'->a because on replacing S'->S , S->a so S'->a . am I correct or not ??
Same confusion!!!! if anybody can explain please do so!
@JAY prakash sorry to say but u are wrong, think if S' wants to go to another option or a non terminal Symbol like AS but in your case you are restricting S' to go only to a terminal symbol a.
@snehal machan Go step by step , first add S'->S (coz S is on the right hand side) then it becomes a case of unit production and after that remove the unit production and also remove more than 2 non terminals.
ya exactly i was wrong . now i have understood .thanx
You made the concept crystal clear thanks ❤
There are no words describe a devotional thank fullness for your work🥺🙇♀️🫶
at 7:37, S'->a (only this should have happened) because S->a; here 'a' is the only terminal and only the terminals and null are replaced in unit productions as told *in video 76 at 1:18*.
Also change on removing A->S
So, the result on removing all unit productions should be :-
S' -> a, S -> ASA | aB | a | AS | SA, A -> b | a, B -> b
Easily the best video on this method, thanks
wow it was great to extract the concept from your videos . hope to see yuh in the upcomming days with new more conceptual videos . thanking you from NEPAL............
Thank you so much for this video❤️❤️it's very helpful for mah MSc exams😘😘
Great explanations in a simple way. Thanks
sir we are glad enoughfor this fav effort u done for us .............
we are eagerly waiting for ur further lectures
Well that was really helpful , I really appreciate your work Sir. Greetings from Pakistan🇵🇰🇵🇰
Hi sir, please upload remaining lectures about PDA and Turing machines. the way you explaining is in simple manner understandable. waiting for your next videos
freaking life saver dude. Good job
Really helpful lectures , I'm waiting for the next one.
Thank you for these videos sir.
plz upload rest of the topic videos which are turing machine, push down automata etc soon. It'll be really helpful for us.
Thank you so much for this great help.
Thank you, is not enough :)
Well appreciated
again superb work thankyou! (India)
Thank you for teaching with wonderful dedication 🇮🇳
This is very Informative video. This cleared my all concepts
Kya badiya smajaya bahishab aap see ,well done
thank you neso u helped alot. full playlist completed
Thank you Sire , for anyone in FEUP i have to say Sir you are gud!
super suportive sir, sir!
Thanks buddy for this its helpful for my internals
I found the same question which is in my exam thank you!
😂
Awesome lecture sir ..... Thank you
Null production removal method in previous video is different from this one. Please tell which one is correct and should be followed.
Both are same, in this lecture the concepts of removal were directly put into action.
@@cricadic rather than saying it the same, you should explain it. useless
sir please add push down automata lectures also it will be really helpful and appreciable .........great work..
ur lectures are outstanding..plz upload cnf to gnf conversion quickly
if it possible plz upload pushdown automata.
pls upload the videos of PDA and turing machine and thanks for such an excellent videos
it will definitely help me in exams.....
2022.. and students still follow these videos .
sir pls upload all remaining videos.......its very helpful for us.
11:08; i thought rather than introducing new production Y -> a, we can use A->a, but that would also allow other productions of A which we don't want. that's why we introduce Y that only goes to a and nothing else.
Awesome Series.. very much recommended...
Sir plz provide the lectures on PDA and TURING MACHINES🙏
Superb explanation❤️
It the best explanation, Thank You Neso Academy
Great explanation thank you sir!!
Right, now i can sleep peacefully
Thank you so much Sir 😇💫
You're a life saviour 🔥
Helped out a lot, thanks my dude!
Most Beautiful explaination ❤❤
well explained ,greetings frm texas
Excellent ,thanks sir
thank you sir for making that helpful vedio. pleace also make vedio about PDA and turing machin
please upload PDA and Turing Machine Videos. Your videos really help.
Thank-you sir very useful and helpful
Thank you so much neso academy
Same from York of the UK
Thank you from uk❤
Thank You So Much 💖
Add some more videos, please. And if possible, then please add Microprocessor lectures too.
Amazing explanation. Buch of thanks💗
Helps a lot..🤟
perfect explanation.......
Sir please make the videos on Computer organizations and architecture 🤗🤗
ruclips.net/p/PLBlnK6fEyqRgLLlzdgiTUKULKJPYc0A4q
@@nesoacademy sir but this is not in detailed as per our college syllabus can you please refer that 🙏🙏🙏.
Good explanation
GOD TEACHER
You saved my life
Sir canyou plz upload video on PDA , PDA to CFG conversion ,CFG to PDA conversion and TURING Machine
sir pls upload more and more videos on this subject as early as possible
I am completely dependent on your videos
my syllabus for this paper is upto turing
machine
pls help me
thank u so much for this videos
Thank you that's all i can say 🙌🏻❤️
Sir please upload all the lectures till April before my exams which starts on first week of may
Neso Academy Thank you sir and please try your best
Neso Academy try na karo video daalo.
Thank you
A plathero of thanks❤️
Thank You.
Thank you so much sir🙏
harika anlatmıs cidden
Thanks!
thanq sir
Please ,please🙏🙏
please complete the Theory of Computation course.Please upload videos of rest of the topics and their examples i.e., PDA and Turing machine
I have semester exams from 2nd week of next month.
Please upload.
NESO ACADEMY has helped me a lot in getting good marks in my previous semester.
Please help.
Thanks for the video
Excelent work
Thankyou sir
Thank you for the video!!
Fantastic video.
neso bhai saare subjects ke videos daalo. mai vit mai hu humare college mai sare bacche neso se hi padhte hai. please aur bhi subjects daalo. vit mai pata karo aur konse subjects hai unki bhi video daalo.
Isn't this the same example from the book "Introduction to the theory of computation" by Michael Sipser?
my life depend on you!!!
Sir, please upload the video of Push Down Automata and Turing Machine
In step 4,can we replace the most right sided SA with X????
No, then you'll have only one Non terminal symbol, which is not in CNF.
I know this comment is kinda late )
sir please upload the remaining videos as soon as possible..please
🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
sir plz upload lectures on pushdown automata and turing machines as soon as possible
its amazing
Hi! I wanted to ask what should you do if you have:
A--> SbS ?? how can you transform it to CNF?
Thanks in advance :)
A->XS
X->SY
Y->b