The Gateway to Computer Science Excellence
+2 votes
44 views

Consider the following language,

L={xy|x,y belongs to {0,1}* where x!=y but |x|=|y|}

The language is __________.

A. Regular

B. CFL but not regular

 C. CSL but not CFL

D. Recursive but not CSL

Please explain ans is given B

in Theory of Computation by (357 points)
edited by | 44 views
0
I think the language has all strings that can be divided into half such that both the parts are not equal over {0,1} . I don't know how it's cfl as midpoint need to be known.

Please log in or register to answer this question.

No related questions found

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,737 questions
57,291 answers
198,212 comments
104,903 users