A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 | v W ԑ L,with | v | = 2}.

If L is regular language then
a. even (L) is regular and Chop(L) is not regular
b. Both even(L) and Chop(L) are regular
c. even(L) is not regular and Chop(L) is regular
d. Both even (L) and Chop(L) are not regular
Answer:Both even(L) and Chop(L) are regular
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: