TOC: Derivations from a Grammar

This Lecture shows how to derive strings from a given Grammar and how to identify the Languages that can be generated from the given Grammars.

Contribute: http://www.nesoacademy.org/donate

Website ► http://www.nesoacademy.org/

Facebook ► https://goo.gl/Nt0PmB

Twitter ► https://twitter.com/nesoacademy

Pinterest ► http://www.pinterest.com/nesoacademy/

Music:

Axol x Alex Skrindo – You [NCS Release]

m>0 and n>0 if it >=0 there will be a power like a^0 and Which will be 1 anyway superb class

good explaination!!!!

can we write example 3: a+b+ like this

good

In example 1 the result we got is in the form a^nb^n..But we know this language can't be accepted by Finite Automata…I'm confused..Plz explain…

is g1 left linear or right linear? 3:00

in example 3 m,n >=1

Amazing video man!! Thanks a lot!

At 2:30 why you didn't further divided aA to aaAb and again you could have divided aA to aaAb and so on…

sir how can we generate production rules if its not given in the question itself can you explain please

in g3 grammar : m,n>=1

Last sum last step is hard. How come it is equal to 0. It should be greater or equal to 1 . Right??? 🙄🙄

In Ex-3 it should be m>0&n>0.

Thank you.

#Excelent!

Thank you sir for the videos! they are great!

One mistake though: in example 3, epsilon isn't in the language, therefor m & n can't be equal to 0, it should be m>0 & n > 0.

great work sir

jahapana tusi great ho. 🍑 Tofa qubool karo

Thanks a lot sir……its so helpful to me……

In example 1 why did not put tha value of aA instead of A in line 3,

Is Answer correct,i think it should be (a**3+n)(b**2+n)..

Thank you so much sir .

drive

Thank you so much. It's been really helpful for students.

Great explanation.

Can we keep on substituting aA as aab??????….

m n should be >=1

L(G3)={a^m b^n}|m,n>0

last problem- m>=1,n>=1

Is the grammar given in example 2 Right Linear or Left Linear?

why did u substitute the 2nd relation twice?

Is , for example string "aAb" a string generated from grammar in example 3, or capital "A" is not allowed to be in final string?

sir, in last you said that m,n>=0 how?

they must be >=1

Thanku really helpful

sir, you teach us

in a very good manner

this videos are very much helpful for me.

In the lecture m>0 and n>0

How in L(3) = (a^m ,b^n | m>=0 , n>=0)

I thought it would be L(3)= (a^m, b^n | m>0 , n>0)

can L(G2) be also empty string?

very good video.

Are these examples of regular grammar or just grammar?

In example-1 the grammer is "regular grammer".. so language generated by it would be regular language.

Here language generated is of type (a^n b^n).which we have already proved irregular by "pumping lemma"….what you say about it ….?????

IN example 2 we can derive 'aab' 'aaabb' and other infinte strings like that if we use A->a or B->b randomly ??

what about m+n=2k+1 with k,m,n>=0 ? some idea please

Could we not generalize L(G3) as {a^+ b^+ } ?

.

a^+ and b^+ meaning the positive closure of a and b respectively .

Give this man an Award! Wow 6 months of semester covered in 96 videos…

thankyouuuu

Sir, in example 3, why m,n=0? a and b to the power will give null and null is not accepted in the language.