Consider the following grammar over alphabet ∑={x,y,z} which is given below,…

Consider the following grammar over alphabet ∑={x,y,z} which is given below, where S and A are non-terminals.

G1: S → xSy | xAy A → zA | ε

G2: S → ySx | yAx A → zA | ε

Consider the language LM which is complement of (L(G1) ∩ L(G2) ).

Select the correct option with reference to LM

  1. A.

    LM is finite

  2. B.

    LM is infinite and regular

  3. C.

    LM is CFL but not regular

  4. D.

    LM is CSL but not CFL

Attempted by 21 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…