Sir your videos are providing ultimate support.....Very nice teaching Techniques....I wish all the teachers can teach like you.....Thank You so much....With regards.
Respected Sir, the rule 1 has a correction : Instead of adding A - > x we should actually add the production A -> RHS of B. You did this while solving the example on conversion of CFG to CNF. Please correct me if I am wrong. Thank You.
sir your all videos for TOC are very supportive. but what abt remaining topics? please upload it sir like pda to cfg, cfg to pda, pumping lemma for CFL, Turing machine, and etc....we are waiting for your videos sir.. others videos not making any concepts clear very well. but your videos are get perfectly in mind at once directly. so please upload as early as possible.... thank you very much.....
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?
Here is the order you should go by, don't do one before the other! 1. Add the new start symbol 2. Remove NULL productions 3. Remove Unit productions 4. Reduce and finalize
@jijipoms6894 it's unreachable because there's no Terminals, beginning from the Start Terminal, that enters the Terminal Z, M, and N. Therefore they're excluded.
Does it work if A -> B and B ->abcd. Where {A, B} are non-terminal symbols and {a,b,c,d} are terminal symbols? (Aka if it does work for multiple terminal symbols)
Sipser, Michael. Introduction to the Theory of Computation. 3rd ed. Boston, MA: Thomson Course Technology, 2012. ISBN-13: 978-1133187790 It's much better than the book the previous comment suggests. It's more exhaustive, relevant, and elegant. Just the fact that it's written by Michael Sipser should be enough.
Sir, never got explained like you. You have a beautiful way to explain the things
Thank you for saving my final exam!!
Thank you so much for these lectures. It's really helpful as i have my exam in a week💗🙏🏻
Got mine in less than 12 hours
@@arihantjain2646 all the best :)
Sir your videos are providing ultimate support.....Very nice teaching Techniques....I wish all the teachers can teach like you.....Thank You so much....With regards.
you are saving my TOC module!
I am so overwhelmed. Never understood this concept before.
Thanks a lot sir 🙏🙏
Keep going 👍😎
Respected Sir, the rule 1 has a correction : Instead of adding A - > x we should actually add the production A -> RHS of B. You did this while solving the example on conversion of CFG to CNF. Please correct me if I am wrong. Thank You.
sir your all videos for TOC are very supportive. but what abt remaining topics? please upload it sir like pda to cfg, cfg to pda, pumping lemma for CFL, Turing machine, and etc....we are waiting for your videos sir.. others videos not making any concepts clear very well. but your videos are get perfectly in mind at once directly. so please upload as early as possible....
thank you very much.....
He has Uploaded!
Sir check playlist he already post. Thank you sire!
@@ricaspinto Bro you should check when he commented that 😂 lol
Thank you very much sir these videos helped me a lot
Thank you so much your videos are easily explained and understandable for a correspondence student like me it was very helpful
Super explanation
This course is followed step by step in colleges.
sir thanku very much for ur great work when will u upload videos on PDA and there conversion from CFG nd to CFG
Sir, can you show an example about how to simplify the CFG like A->B, B->A. An real case must be more complex.
Thank you Sir..
Yup Videos are great and you got good sense, really very calmly you explained the concepts.
You guys are the best
Please what if A-> B|a and B-> bbA|b.
Can x be a sentential form , or must it only be a terminal symbol🙏
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?
Here is the order you should go by, don't do one before the other!
1. Add the new start symbol
2. Remove NULL productions
3. Remove Unit productions
4. Reduce and finalize
@@VrejGaming ❤
Very nice explanation!!!
This is really simple. All we have to do is remove the non terminal on rhs and substitute by it's corresponding terminal symbol.
i appreciated your teaching thnk you
Great Explanation.
We can know Z,M and N are unreachable symbol from the very start then why simplify till last and then remove?
hello. do u happen to know how Z, M, and N are unreachable symbols? I don't understand the last step.
@jijipoms6894 it's unreachable because there's no Terminals, beginning from the Start Terminal, that enters the Terminal Z, M, and N. Therefore they're excluded.
Because from the first steps, there can be additional unreachable symbols
For understanding😂
We know we won't work on this concept after we get a job then why studying till the end of semester?
I do not think the production should be a terminal consider S-A, A-B, B-CD (NOT A TERMINAL), C-aD, D-b
Sir why you not take S-> XY
what if S is in below production from X Y Z etc ?
does S also count as non terminals ?
Does it work if A -> B and B ->abcd. Where {A, B} are non-terminal symbols and {a,b,c,d} are terminal symbols? (Aka if it does work for multiple terminal symbols)
Then it does not need to simplify .. it's already simplified.... Ryt ? A->B here A it's self is a start symbol !!!
Sir non terminals are always in capital letters and terminals are in small letters?
sir cant we remove x-->a and put s--> ay ????
Thanks a lot for the nice video
You should give more examples. Please
Sir,Can you make video about elimination of left recursion with examples....it will help to us
Since Z -> a and X -> a can we also write as Y -> X | b instead of Y -> a | b ?
Noo u are doing reverse u have to substitute........non- terminal values into terminal values.....
“x can be null”
What is ‘null’ here exactly???
Please clarify…
Thanks🧡
what if N->a is not given ?? also what if N->a and N->b is given how do i choose between them??
z,m and n will be unreachable symbol so remove them (not sure)
(1) If N->a is not given then Z, M, and N can all be removed.
(2) If N->a and N->b just write N->a|b.
well explained
While Removing Unit Productions, If S->A, A->B, B->C, C->d then after eliminating all Unit Productions we can write final Grammar S->d
Sir plz complete the syllabus of signal and systems
he complete check playlist sire love from portugal
Thankyou sir
is S-->AA a unit production?
i think S--XY is also the part of unit production. isn't it?
no it isn't. See the definition
Is there any difference b/w start symbol and non terminals?
Because it have two non terminal we remove only one non terminal
bful pic
are u beti of negi sir?
Wow!!!
How to distinguish between terminal and non terminal symbols????
isn't it wrong that x has to be a terminal... pretty sure it can be a string of ternimal and non-terminals
Why we didn't take S->xy as a unit production
Explain
Thank you
What if A-> B|a and B-> A|b? How to remove A->B and B->A?
then
A-> A|b|a and A -> A part can be removed.
Suppose,
B-->A
A-->0
A-->12
----------
Should I write.., B-->0 (or) B-->12 (or) B-->0|12.
Plz help me.
I assume it would be B --> 0 | 12
I don't know.
rohitaug has presented the simplest form
B----> 0/12
Sir ...can you suggest a book to be used as textbook for automata theory????
Sipser, Michael. Introduction to the Theory of Computation. 3rd ed. Boston, MA: Thomson Course Technology, 2012. ISBN-13: 978-1133187790
It's much better than the book the previous comment suggests. It's more exhaustive, relevant, and elegant. Just the fact that it's written by Michael Sipser should be enough.
PEARSON #3 EDITION
sanskrit gita v2
thnk u sir
Cade os automatos de pilha? paiou!!
how to identify non-terminal symbols
Capital letters like A B C D
Its also called variables
Can X--> a also be removed..??
I think so. X is only used once. You could easily write - S-->aY and keep Y --> a | b.
no we can not bcs X is not unreachable symbols
@@zahreddinesoualem3213 but if we see more clealy then ....S -->X is also unit production and also we have X-->a so we can replace X here
@@divyansharya7640 its XY NOT JUST X
it's like path compression in the union-find algorithm!
Zindagi chune engineering nahi.
Sir you make very long video for simple please short thank you sire
love you sire
Removal of Null productions
Miller Elizabeth Davis Thomas Harris Elizabeth
Lllpn..
baba büyüksün..
th-cam.com/video/y7Cl8YEXp9Y/w-d-xo.html
whats this?