The Gateway to Computer Science Excellence
0 votes
815 views

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) $\mid$ W $\in$ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W $\mid \mathcal{v}$ W \in L, with $\mid \mathcal{v} \mid$ =2}. If L is regular language then

  1. even(L) is regular and Chop(L) is not regular
  2. Both even(L) and Chop(L) are regular
  3. Even(L) is not regular and Chop(L) is regular
  4. Both even(L) and Chop(L) are not regular
in Theory of Computation by Veteran (105k points)
recategorized by | 815 views

2 Answers

+1 vote

Since in both case the word obtained after removal belongs to that particular language L. and the language L is regular

so both the Languages defined by even and Chop are regular

by Active (1.9k points)
0 votes

Ans: B Both even(L) and Chop(L) are regular

by Loyal (7.2k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,430 answers
195,213 comments
99,927 users