search
Log In
2 votes
58 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
edited by
58 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

...