For Context: This is Formal Languages and Automata.

Does the expression (0+1) (0+1)*)* 00 (0+1)* denote the language in Example 3.5? EXAMPLE 3.5 For = {0,1}, give a regular expression r such that L(T) = {w * : w has at least one pair of consecutive zeros}. One can arrive at an answer by reasoning something like this: Every string in L (r) must contain 00 somewhere, but what comes before and what goes after is completely arbitrary. An arbitrary string on {0,1} can be denoted by (0+1)*. Putting these observations together, we arrive at the solution r = (0+1)* 00 (0 + 1)*