Theory of Computation: Construction of CFG - Examples 

watched many videos for cfg construction but believe me this one is the best

Why is this subject so difficult 😭

I rarely comment on videos but here i must say THANK YOU madam and may you live long. You have explained the whole semester in just 21 minutes. At least i am OKAY now. THANK YOU once more!

I solved all of them, and now I feel really ready for the final exam, THANK YOU SO MUCH!

Exordinary teaching I watched many videos but I got it here by watching this video... Thanku mam...

Your explanation made it finally click for me! thank you for the effort you put into this

Thank you for the video. 🥺I was nervous about my exam. Learning from u gave me confidence.

I think Q4 should be "At least 1 occurrence of 000" Becauseif exactly 1 occurrence of 000 means we have to do via different way

I usually don't comment on videos But this actually help me to get the concept

Trust me, I am passing my exams with your vedios mam.

Amazing tutorial 👍👍👍👍 One of the best video 👍👌👌👌

Thanks a TON, you just made it so easy

I was searching some example now I found a good vedio Thank you mam

mind....mind....mind bloing ....sper super strt in teaching style ..................................totly amazing jhakas............. amazing teaching style

Tamil mam's are most sweetest in my college my microprocessor teacher is also from tamil nadu and her voice is and accent is very similar to you

This is the best video of cfg mam.😊

Best video for practicing CFG examples

Mistakes Q4 : one occurrence 000 but your transition will give 0001000 two occurrence Q5 S -> AaAbA A -> AaAbA / epsilon

You're an amazing teacher!

dominant video. thank you. love this and you. pleasant voice!

9:11 how can we add any number of zero and one at the beginning ? Because occurrence of three zero at the beginning will not satisfy the condition of only one occurrence of zero. eg. it can generate 000 000 011110 which has two occurrence of 000

This helped me a lot . Thank you

subscribed after watching this amazing explanation, i think you can start teaching the whole theory

This is great explanation.

SHE IS GIVING ROYALTY

Very good examples chosen 😊

your content is so good very easy to learn

Thank you so much mam. Saved my exams

you just saved my life😊

Thank you mam.you are help getting good marks in exam💛

Thank u so much mam, now i am gainin g confidence for examination .

Hi, in 5th example, for n equals one ccording to language which is a^nb^n we should be able to get ab. . But S terminal goes to ab string, so we can't get ab string.

Loved it

thank you madam. you're an angel........................

Awesome.. Quick and Effective.

Awesome ....really very effective video.😃

thank you. This video was very useful

Amazing Explanations!

Thank you very much miss. 😃

Best video for real ❤❤❤❤

I Need more prectice video like this

thankyou so much mam.iam having semester exam tomorrow.

you are amazing! Thank you so much

Thanks mam, great explanation

mam n>=0 ki bhi doo na example tomorrow is my final toa wish me luck luck 28 kuriiiiiii daaaa

nicely explained...keep it up

Yes! Something for practice

Best cover all things thank you

Thanks a lot, ma'am.

thank you so much you are my hero ❤❤❤❤

Best one 👍

awesome video, thank you so much!!!

great explanation mam!

Thanks..now i understand.

really helpfull thank you so much

maza agya mam kya pdhaya hai

In The 12th one if we take a^m+n then its Language would be changed it will be like if we take : m=2,n=1, Then , L=AAABBC and if we take like m and n separately then how can we again take the String of 'M' asa in S =>aSc/aAc A=> aAb/ab So here we can not take the stringbwhich is a^m in the String aaabbc these aa will be left

Ex 4 is wrong You can have more occurences of 000 with your cfg

amazing muhhhah

well done!

Design an CFG for Stings with more than 2 zeros. ∑ = {0, 1}

THANKS A TON MAM 😊😊😊

thank you thank you thank you thank you

super class

Great explanation👍 I have a question .What is the cfg for (a*ba*ba*)*

THANK YOU VERY MUCH

Thank you.

Each word contains odd number of b's and even number of a's. Plz answer mee

i love your black hands

Why is epsilon there as a first element in lamguage, in the first question?

6) must be S -> aSbb S-> abb | E

Thank you so much

are we using left derivation solving these or is it jus your own preference

Thank you very much mam

why cant we replace epsilon in eg 5,6?

Thank You Mam

At 7:54 how can abba be a string for that regular expression ? Can anybody explain ?

thank you mam 🤩

if for example 9 we have m and n >=0 how do we write it then

prefect

Thanku soo much ma'am 🤍

this one is awesome one best out of best

D best . Tqsm 😭

Where m,n graterthen equal to 1 Means the language L(abc,aabbcc......)

Thanks

yeh yeh

Mam why we not took the epsilon in prblm no 6

in 5 th example can we also write it as S->aAb A->ab please answer asap i got final

thanks

Thanks mam

But cfg cannot have NULL in right side

This is a 2 Mark question ah mam

Tq ma'am

Wrong 11:07 how do you create {ab} from your grammar

Toc haters button ✅

Mam do CNF and GNF conversion

what does S mean

Sporer Courts

Good video but was bit confued with the pronunciation 🥲

A❌ YAY🤣