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 TH-cam 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,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.
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............
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
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
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!
Explanation for why all the production rules from S is copied to S' : because S' is the new starting symbol now, so if we write only S'-> a after removing the unit productions then, the grammar is generating only a, all other non terminals are unreachable. That's why to avoid that case, we are copying all the productions from S to S' along with a. Hope this helps
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.
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 I have a question. In the second step there is we have to remove the null production..but in the grammar there is only B tens to epsilon..there is no A tending to epsilon..from where you got that grammar ..I couldn't get that part
Sir what would we have to do if there exists two terminals on the RHS? Asking because in your method, none of the steps would remove that and a CNF cannot contain two terminals on the RHS
Sir in removing A->S at 8:25 You replace S with it's sting but after that A again start refer to B (A->B) but you does not replace B with b(smal b(terminal)) in end why? Please answer
Where do you have A->B? You have A->b, A->ASA, A->aB, A->a, A->AS, A->SA but never A refering B alone, you have to replace when you are refering to a single non terminal simbol, like in S'->S and A->B and A->S
hello neso academy first of all thanks for the automata vdos ,this will help me a lot for my coming semester as it covered the whole syllabus and I learned all that.....I want to request u to upload d vdos on turing machine and PDA too as early as possible cz, my exams r one month later and this is in syallbus too. ur vdos helping me to score good in automata ...
In 11:52, you said that Y=a, then you have to change all 'a' production into 'Y'... But if u r doing so.. Then each production you have a add 'Y' individual(S'=Y, S=Y & A=Y) . Which can't possible...
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.
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
This Academy is litrelly saving lives of many students 😭...
All I wanna do is Thank You🙏
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!!!
Please upload the rest of the videos asap.You are doing a huge service to mankind by making these videos.
i have no words for the way you explain a topic .... its like learning from the topic itself... great respect whoever you are
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 TH-cam 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..
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,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
Thank you so much for this great explanation , understood fully.
Cristal clear explanation sir💀.. thank you soo much.. ur vedios r our all time saviours.
You are born to teach.
Thank you, is not enough :)
Well appreciated
You made the concept crystal clear 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............
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
There are no words describe a devotional thank fullness for your work🥺🙇♀️🫶
Thank you so much sir
The way of explaining the concepts are very good
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
freaking life saver dude. Good job
Thank you so much for this video❤️❤️it's very helpful for mah MSc exams😘😘
Great explanations in a simple way. Thanks
Well that was really helpful , I really appreciate your work Sir. Greetings from Pakistan🇵🇰🇵🇰
sir we are glad enoughfor this fav effort u done for us .............
we are eagerly waiting for ur further lectures
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🥳
This is very Informative video. This cleared my all concepts
again superb work thankyou! (India)
Explanation for why all the production rules from S is copied to S' : because S' is the new starting symbol now, so if we write only S'-> a after removing the unit productions then, the grammar is generating only a, all other non terminals are unreachable. That's why to avoid that case, we are copying all the productions from S to S' along with a.
Hope this helps
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.
Thank you for teaching with wonderful dedication 🇮🇳
It the best explanation, Thank You Neso Academy
Really helpful lectures , I'm waiting for the next one.
Amazing explanation. Buch of thanks💗
Most Beautiful explaination ❤❤
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.
Thanks buddy for this its helpful for my internals
I have a doubt , in 4th step there are two more non terminals AS|SA which violate the CNF , shouldn't we change them too ? Please reply.
S' -> AS|SA
This can be written as,
S' -> AS
S' -> SA
That's why it is valid
@LikhitSB thanks !
thank you neso u helped alot. full playlist completed
Thank You So Much 💖
Awesome lecture sir ..... Thank you
Thank you so much Sir 😇💫
Thank you Sire , for anyone in FEUP i have to say Sir you are gud!
super suportive sir, sir!
Superb explanation❤️
Thank you from uk❤
sir please add push down automata lectures also it will be really helpful and appreciable .........great work..
I found the same question which is in my exam 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
Kya badiya smajaya bahishab aap see ,well done
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.
pls upload the videos of PDA and turing machine and thanks for such an excellent videos
it will definitely help me in exams.....
at 10:46 we took x->SA not x->AS as AS was also common of the three. Any specific reason?
just a matter of preference nothing else.
Helped out a lot, thanks my dude!
Awesome Series.. very much recommended...
ur lectures are outstanding..plz upload cnf to gnf conversion quickly
if it possible plz upload pushdown automata.
sir pls upload all remaining videos.......its very helpful for us.
Thank you so much neso academy
Sir I have a question. In the second step there is we have to remove the null production..but in the grammar there is only B tens to epsilon..there is no A tending to epsilon..from where you got that grammar ..I couldn't get that part
because he remove B from A so there remain null.
You're a life saviour 🔥
Thank you that's all i can say 🙌🏻❤️
Great explanation thank you sir!!
Sir what would we have to do if there exists two terminals on the RHS?
Asking because in your method, none of the steps would remove that and a CNF cannot contain two terminals on the RHS
well explained ,greetings frm texas
Sir plz provide the lectures on PDA and TURING MACHINES🙏
Sir in removing A->S at 8:25
You replace S with it's sting but after that A again start refer to B (A->B) but you does not replace B with b(smal b(terminal)) in end why? Please answer
Where do you have A->B? You have A->b, A->ASA, A->aB, A->a, A->AS, A->SA but never A refering B alone, you have to replace when you are refering to a single non terminal simbol, like in S'->S and A->B and A->S
hello neso academy first of all thanks for the automata vdos ,this will help me a lot for my coming semester as it covered the whole syllabus and I learned all that.....I want to request u to upload d vdos on turing machine and PDA too as early as possible cz, my exams r one month later and this is in syallbus too. ur vdos helping me to score good in automata ...
Thank-you sir very useful and helpful
Helps a lot..🤟
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
Thank you for the video!!
thank u so much for this videos
Sir please make the videos on Computer organizations and architecture 🤗🤗
th-cam.com/play/PLBlnK6fEyqRgLLlzdgiTUKULKJPYc0A4q.html
@@nesoacademy sir but this is not in detailed as per our college syllabus can you please refer that 🙏🙏🙏.
Fantastic video.
A plathero of thanks❤️
Thank you so much sir🙏
Good explanation
I think starting symbol 'S' should not be appear on the right-hand side of any production ?
thanks sir❤🔥
sir,(S->AX/aB/a/AS/SA) why the last SA is not replced by X ?
Thanks for the video
thank you sir for making that helpful vedio. pleace also make vedio about PDA and turing machin
Excellent ,thanks sir
In 11:52, you said that Y=a, then you have to change all 'a' production into 'Y'... But if u r doing so.. Then each production you have a add 'Y' individual(S'=Y, S=Y & A=Y) . Which can't possible...
perfect explanation.......
please upload PDA and Turing Machine Videos. Your videos really help.
At the last step can we replace the S -> aB with S -> SB ??
we have a production of S -> a...so we can replace that a with S...right?
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.
Isn't this the same example from the book "Introduction to the theory of computation" by Michael Sipser?
at 10:45 - why let X -> SA and not say X-> AS ?
because that do not have both terminal and non terminal
You saved my life
Are S,S' the start variables or is it only S? We can see that there is no way to reach S' if the start variable is S alone.
What Should we do if there is no S on RHS?????
Does S being on the right side have any relation to right linear grammar?
Add some more videos, please. And if possible, then please add Microprocessor lectures too.
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
🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
I have a doubt since we remove the unit production don't we remove B->b as well
at 10:36 don't u think that in s',s and A we can write them as : AX|aB|a|AS|X in s and s' and in A> b|AX|aB|a|AS|X ????