The Gateway to Computer Science Excellence

0 votes

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

- 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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,648 questions

56,430 answers

195,213 comments

99,927 users