Let L be any language. Define even (W) as the strings obtained by extracting…

PYQ UGC NET 2014

Let L be any language. Define even (W) as the strings obtained by extracting from W the letters in the even-numbered positions and even(L) = {even (W) | W ∈ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W | ν W ∈ L, with | ν | = 2}.

If L is regular language then

  1. A.

    even(L) is regular and Chop(L) is not regular.

  2. B.

    Both even(L) and Chop(L) are regular.

  3. C.

    even(L) is not regular and Chop(L) is regular.

  4. D.

    Both even(L) and Chop(L) are not regular.

Attempted by 74 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…