I feel like I'm confusing myself perhaps but I'm having a bit of trouble figuring out how exactly this language works. I'm given the following regular expression
(a + b)* (abba* + (ab)*ba)
Can someone clarify to what union is compared to concatenation? Looking at
(a + b)*
Is it { $\epsilon$, a, b, ab, ba, aa, aab, bbb...)? I just want to make sure, for union, that I can have any combination of a and b in whichever order.
Can I also have an example of what a word from this language may be? From what I gathered
aaababbaabbaababba
abbaba
bba
ba
would all be valid words in the given language, correct?