Theory of Computation - Context free languages
- 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.
- Option : A
- Explanation : S → aB → aaBB → aabB → aabb So (b) is wrong. We have S → aB → ab So (c) is wrong. A careful observation of the productions will reveal a similarity. Change A to B, B to A, a to b and b to a. The new set of productions will be the same as the original set. So (D) is false and (A) is the correct answer.
