Both the languages have x,y belongs {0,1} then what type of languages are both
L1={x ∣x has an equal number of a's and b's}
L2={xy | #a's in x = #b's in y}
For L1 i think it is CFL , on a's push onto the stack on seeing b pop from stack, finally stack empty accept the lang.
For L2 how to find middle of string where x is ending and y is starting....??