Context free lang9

0. Which of the following definitions below generates the same language as L, where
L = {xn yn such that n > = 1} ?
I. E —> xEy | xy
II. xy | (x+ xyy+)
III .x+y+

  • Option : A
  • Explanation :
    II generates strings like xxyyy, which are not supposed to be.
    III generates strings like xyy, which are not supposed to be.
    I can be verified to generate all the strings in L and only those.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *