0 votes 0 votes himgta asked Oct 19, 2018 himgta 357 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Utkarsh Joshi commented Oct 20, 2018 reply Follow Share @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 votes 0 votes himgta commented Oct 20, 2018 reply Follow Share @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 votes 0 votes Utkarsh Joshi commented Oct 20, 2018 reply Follow Share 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. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes D is the ans anurag sharma answered Oct 20, 2018 anurag sharma comment Share Follow See all 0 reply Please log in or register to add a comment.