Consider the following regular expression, where 'a' and 'b' are the only letters in the language generated:
b* a b* a (a+b)*
For example, this can generated the word: bbabbbabbaa since the first b* can be used to generate two b's followed, then an 'a', followed by three b's in the second b* followed by an 'a', then (a+b)* can be used to generated a 'b', 'b', 'a', and an 'a'.
What is the most interesting thing about the language generated by this grammar (one English sentence)?