edited by
2,297 views
0 votes
0 votes

Let $L$ be any language. Define $\text{Even} (W)$ as the strings obtained by extracting from $W$ the letters in the even-numbered positions and $\text{Even}(L) = \{ \text{Even} (W) \mid W \in L\}.$ We define another language $\text{Chop} (L)$ by removing the two leftmost symbols of every string in $L$ given by $\text{Chop}(L) = \{W \mid \mathcal{v} W \in L,$ with $\mid \mathcal{v} \mid =2\}.$ If $L$ is regular language then

  1. $\text{Even(L)}$ is regular and $\text{Chop(L)}$ is not regular
  2. Both $\text{Even(L)}$ and $\text{Chop(L)}$ are regular
  3. $\text{Even(L)}$ is not regular and $\text{Chop(L)}$ is regular
  4. Both $\text{Even(L)}$ and $\text{Chop(L)}$ are not regular
edited by

2 Answers

1 votes
1 votes

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

Answer:

Related questions

0 votes
0 votes
1 answer
2
makhdoom ghaya asked Jul 15, 2016
2,334 views
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Chomsky Normal form} & \text{i.} & S \rightarrow b S S...
3 votes
3 votes
2 answers
4
go_editor asked Jan 6, 2017
5,313 views
Four bits are used for packed sequence numbering in a slinding window protocol used in a computer network. What is the maximum window size?481516