Theory of computation-question on language generation


#1

Let L={w∈{0,1}∗|number of occurances of (110)=number of occurances of(011)}

What is L?


#2

Listen I think it might be any string having 0 at beggining and also at end along with every 11 must be preceded and followed by 0.


#3

The L may be (110+011)(0+1)*(011+110)