UGC NET CS 2014 June-paper-3
August 21, 2024Software-Engineering
August 21, 2024UGC NET CS 2014 June-paper-3
|
Question 15
|
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
|
even(L) is regular and Chop(L) is not regular.
|
|
|
Both even(L) and Chop(L) are regular.
|
|
|
even(L) is not regular and Chop(L) is regular.
|
|
|
Both even(L) and Chop(L) are not regular.
|
Correct Answer: B