So we're taking languages, and I understand regular expressions from a computer science perspective. I know that L* is basically L repeated any number of times from 0 to infinity (So if L = {a}, then L* is {empty, a, aa, aaa ...}.
But while doing proofs, a number of times there has been mention of L = L* or L = L+ or L = LL. (With L NOT being empty)
I don't get how this can be possible? There's even a question that states L = L* iff LL = L.
I have already written down my answer but I still don't understand it intuitively.
Assume $L=a^*$. Can you compute $L^*$ ? More generally, can you compute $(L^*)^*$ ?