Discrete math

[minstrel]

Prove that a particular CFG grammar generates language L

L = { w ∈ {x, y}* | N(y) = 2N(x) }
G = S -> yySx | ySxSy | xSyy | SS | e

could you show how to prove it?
thank you

 

[Deleted member 4993]

Prove that a particular CFG grammar generates language L

L = { w ∈ {x, y}* | N(y) = 2N(x) }
G = S -> yySx | ySxSy | xSyy | SS | e

could you show how to prove it?
thank you

Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:

READ BEFORE POSTING​

Please share your work/thoughts about this problem.