Simplification of CFG (Removal of Null Productions)

preview_player
Показать описание
TOC: Simplification of CFG (Removal of Null Productions)

This Lecture shows how to Simplify a given CFG by removing the Null Productions

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

You have no idea how many good wishes you're getting from the ppl who watch before exams. Very nice video.

sairohit
Автор

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!

seijumimurasakibara
Автор

Honestly, that was really well explain. Beats reading over-complicated textbooks any day.

R-ey
Автор

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

mohammadsarwar
Автор

Make videos like this dont change ur style dont forget we watching, because it is very clear and easy to understand never start rushing bro

HiddenLove_opl
Автор

İngilizce bilmediğim halde anlıyorum hocam helal olsun size keşke tüm hocalar sizin gibi olsa

zeynepturhan
Автор

Thanks for all the series of videos...awesome job and ya helped lot for one night exam preparation..kudos

purvagaikwad
Автор

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🥺

priyanka
Автор

pls upload all remaining lectures, as soon as possible

CodeCareerWithAdarsh
Автор

Good explanation every thing cleared such a magical person in the world

kiranvinith
Автор

This channel is very professional....thanks a lot...you're channel is the best thing that YouTube recommend it to me 😊

Rayan--Madride
Автор

i mean what kind of simplification is that, having 12 choice instead of 6 is not simplification imo

denizsanl
Автор

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?

shaunakshetye
Автор

valuable video sir, i have a request to upload push down automata lecture ....plzzz

SimranGovind
Автор

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 😇😊

Rayan--Madride
Автор

For ABAC production I can use binary analogy for replacement where 0 means no replacement and 1 otherwise. 000, 001, 010, same can be applied to other productions

rawlayer
Автор

Can you please add a clarification that you need to consider a case where both A's are null?

azeletronics
Автор

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 ???

onlysisir
Автор

tx u sir it helped me a lot i am ur
fan from

vijayvijju
Автор

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)

barnumcastillo
join shbcf.ru