The Gateway to Computer Science Excellence
0 votes
81 views

in Theory of Computation by | 81 views
0
D?? is it correct??

Not getting any clue thought over it for almost 20 minutes! it might be simple but not able to think in the correct way!!
0
What is the answer given??
0

which option according to you is correct??Verma Ashish

0
It's very difficult to eliminate given options by choosing counter example...

If you get any counter example which eliminates some options then please share..
0

@Verma Ashish

@Utkarsh Joshi

they have given d as the answer

0
okay! :)
0

@himgta @Verma Ashish Here's How I got D

Let L be a regular language- 0+1+

so L={01,001,0010...}

{xx| x ∈ L} according to me will be a CSL. Hence eliminated A and C.

For B and D I am not getting a proper example. Correct me if I am wrong.

 

 

0

@Utkarsh Joshi

As per your approach!

Let L={a}

As it is finite ,it is regular 

{xx|x belongs to a}

means aa,this is also regular!

0

himgta We have to look for a "counterexample" to eliminate some of the options!! we can come up with 100 such languages like you considered which conveys option A is correct. But it won't prove anything about class of a language. But even 1 counterexample is enough to prove/disprove something! I am trying to do that.

1 Answer

0 votes
D is the ans
by
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
52,315 questions
60,433 answers
201,779 comments
95,257 users