Consider a language Lx over Σ = {a} such that every string in Lx is of even…

 Consider a language Lx over Σ = {a} such that every string in Lx is of even length.

Consider another language Ly over Σ = {a} which is formed by taking all the proper prefixes of strings in Lx.

Which of the following options is correct w.r.t Lx and Ly:

  1. A.

     Lx = Σ*

  2. B.

    Ly ⊂ Lx

  3. C.

    Lx ⊂ Ly

  4. D.

    Lx ∪ Ly = Σ*

Attempted by 226 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…