Are the languages generated by the regular expressions $(a + b)^*$ and $(b^*a^*)^*$ the same language?
The solution for this problem is yes, but I couldn't figure out why it is true. The first regular expression $(a + b)^*$ generate all strings over alphabet $\{a, b\}$, it makes sense to me. On the other hand, how does the second regular expression generate, say, the string $abbb$? From my understanding, the order of the concatenation of $b$ and $a$ does affect the result of *. Any idea? Thank you.
The Kleene star * allows zero or more repetitions.