I swear to gods you're much MUCH better than my prof in automata. How I wish you're the one teaching us this in the classroom. Thank you so much!! I feel more confident about going to my exam tomorrow knowing that I at least understood the coverage better than I did before!
I have never commented before in any video this is my first comment thank you so much for this video's ur far far far better than my staffs once again thank you so much man🥺
Help!!from the three rules: 1.Reduction of CFG 2.Removal of Unit production 3.Removal of null production which rule should we apply first for simplification of grammar? or what is the sequence to apply this 3 rules? or they ask only one of them to apply at one time?
Note: To remove all kinds of productions mentioned above, first remove the null productions, then the unit productions and finally , remove the useless productions. Following this order is very important to get the correct result.
What if when we were simplifying we had s give epsilon and some other things like a and AA ...etc ....what do we do ? My theater talk about right rules ? Can someone help me 😇😊
For ABAC production I can use binary analogy for replacement where 0 means no replacement and 1 otherwise. 000, 001, 010, 011.......111, same can be applied to other productions
@False Hope thanks so much really !! Ok my last confusion regarding "removing nullables" S-> A A-> € | x B-> A |Ab We remove the € from the A state , put A=€ We get;' S-> € A -> x B -> A| Ab |b This correct?
@Muhammad Ziaus Siam aren't there hidden nulls like for example S' ---> S S --> ASB A---> aAS | a | € B ---> SbS | A | bb | Won't S' and S have hidden nulls that we would need to remove ?? My professor taught in this way but all the CNF i see don't do that part
You misunderstood the statement... by right hand side he meant, Right hand side of the arrow(->). i.e. in A->XYZ, you need to consider XYZ as the right hand side variables of A.
You have no idea how many good wishes you're getting from the ppl who watch before exams. Very nice video.
yes bro,.whats ur next exam
@@RICK-tj1lz I had formal languages and automata theory. And again I'll have a semester exam on that this month.
exactly :D
True whenever I understand the concept watching Neso videos I legit thank them heartfully🙏🏿...they're life savers of many btech students✨
I swear to gods you're much MUCH better than my prof in automata. How I wish you're the one teaching us this in the classroom. Thank you so much!! I feel more confident about going to my exam tomorrow knowing that I at least understood the coverage better than I did before!
If he did that, all lectures would be done in 30 minutes lmao
Honestly, that was really well explain. Beats reading over-complicated textbooks any day.
I failed the subject twice and had no hope of passing . This was my last chance and I'm extremely confident I'll do well in the exam. Thanks to you
bhai nikla kya exam ??
@@RishabhSinghal12 Haan bhai nikal gaya
@_aftab_hundekari5231 3 chapters perfectly
@@mohammadsarwar4655 Great job bhai.
ye sub to chalta rhata hai
İngilizce bilmediğim halde anlıyorum hocam helal olsun size keşke tüm hocalar sizin gibi olsa
+1
aayein
Thanks for all the series of videos...awesome job and ya helped lot for one night exam preparation..kudos
I have never commented before in any video this is my first comment thank you so much for this video's ur far far far better than my staffs once again thank you so much man🥺
Best source to prepare exams.
This is the island of knowledge 🎉❤
This channel is very professional....thanks a lot...you're channel is the best thing that TH-cam recommend it to me 😊
Help!!from the three rules:
1.Reduction of CFG
2.Removal of Unit production
3.Removal of null production
which rule should we apply first for simplification of grammar? or what is the sequence to apply this 3 rules? or they ask only one of them to apply at one time?
Note: To remove all kinds of productions mentioned above, first remove the null productions, then the unit productions and finally , remove the useless productions. Following this order is very important to get the correct result.
@@ananyasahay NOTED 📝
Good explanation every thing cleared such a magical person in the world
I really like the teaching style
extremely well explained. Thank you.
Awesome sir❤
Excellent explanation! Thanks!
pls upload all remaining lectures , as soon as possible
i mean what kind of simplification is that, having 12 choice instead of 6 is not simplification imo
apply Removal of Useless Symbols after that
@@yourdailyfails1 Isn't it the last step of simplification? No more removal.
What if when we were simplifying we had s give epsilon and some other things like a and AA ...etc ....what do we do ? My theater talk about right rules ? Can someone help me 😇😊
Sir i had a confusion that if the start symbol gives null production then do other variables containing S on RHS also give null production ???
What happens if the language L accepts null? If you remove epsilon from all parts of the grammar G this will not recognize the same language L /= L(G)
that null productions cant be removed.
tx u sir it helped me a lot i am ur
fan from antartica................
???????????????????
i have a question how to detect which which unit production, cfg reduction or null production if only mentioned remnove useless symbols.
Can you please add a clarification that you need to consider a case where both A's are null?
I hav doubt gor the production S->ABAC it must have 5 varieties S->BAC/AAC/ABC/AC/C somebody help but he took 3 cases
Yeah I guess you are right
@Gaming Zone AB thanks
Excellent sir,thanks a lot
Thanks a lot🙏🙏 sir
Masha'Allah bruva ✊🏽
Does it matter if we remove null productions after removing unit productions?
valuable video sir, i have a request to upload push down automata lecture ....plzzz
For ABAC production I can use binary analogy for replacement where 0 means no replacement and 1 otherwise. 000, 001, 010, 011.......111, same can be applied to other productions
what to do if S is also nullable?
sir why we replace left A with null???n As You Do in the First Step?? can anyone explain it to me
same problem here
"Remove A from right" means from the right of the -> arrow in production, not the left and right order of A
Sir why you removed n->a, then why not x->a
kyuki sirf null ko replace karna hai...isiliye original wala to rahega hi
How to remove null production for A->S|epsilon
you are great
Thanks
Thankyou sir
here why b is not remove by epsilon at last step? ,B->bB|b
check the third step
thanks a lot for a the nice video
Don't we need to consider the case of having both non-terminals null?
Sidath Asiri we need
What if we continuously getting null productions while solving to get rid of another null productions!!??
@Vinayak Ojha 😂
nice notes
your the best!!!
Sir do add for Pushdown Automata and Turing Machine!
S->aS/A
A->epsilon
Could you lease solve this?
S->aS
if null comes with the start state then we remove that null too?
@False Hope thanks so much really !! Ok my last confusion regarding "removing nullables"
S-> A
A-> € | x
B-> A |Ab
We remove the € from the A state , put A=€
We get;'
S-> €
A -> x
B -> A| Ab |b
This correct?
@False Hope got it , thanks again :)
Hope you have a great day
@Muhammad Ziaus Siam aren't there hidden nulls like for example
S' ---> S
S --> ASB
A---> aAS | a | €
B ---> SbS | A | bb |
Won't S' and S have hidden nulls that we would need to remove ??
My professor taught in this way but all the CNF i see don't do that part
And if A is the axiom? Do we still need to remove productions like A::= ∈???
sir you said we look for all productions whose RIGHT HAND SIDE........in ABAC is the first A before B is on the right hand side !!
You misunderstood the statement... by right hand side he meant, Right hand side of the arrow(->). i.e. in A->XYZ, you need to consider XYZ as the right hand side variables of A.
What if there’s a production €-->a , what am I supposed to do then……
If you're in exam hurry, listen to his videos at 1.25 speed.
Thank me later!
daman behl 1.25? Lol, I watch at 1.75
Sirs i download videos and watch 3x
thank you sir
Thnaku
Thank you..
Thanks man
please make viedos on turning machine in detail
pushdown automata pls!
Sir Plzzzz add parsers too.
YEAH
why A=>a ??
Because you remove 'A', so you're left with only the terminal 'a'. Hope that helps.
💯💯💯👍🙏
simplify...?🤔
We are going to have our exams in 2 weeks can you put all the vedios faster??
tumhe lagta hai gururaj itne se maan jayega???!!!
if S points towards epsilon what to do
Thank you sir
Thankyou Sir
Thanks
thank you sir