title: Recognising if given language is regular or not
body: <p>L1={xy|x belongs to L and y doesn't belong to L,L is regular}
  is L1 regular?
  a/c to me x belongs to L so it is regular but since y doesn"t belong to L it can be regular or not.But the answer is that L1 it is regular.How can it be shown.</p>