Theory of computation

CS 290 Practice with regular expressions b. All strings that contain the substring aa c. All strings that contain the substring aa and the substring bb d. All strings that contain at least one a e. All strings that contain at least one a and at least one b f. All strings that contain either aa or bb, but not both. CS 290 Practice with regular expressions For each of the following, give three examples of strings that are members of the language described by the regular expression, and give three examples of strings that are not in the language described by the regular expression. (in all of these cases, use (a, b].) 1. a. a'b b. (ab')a c. (b a)" d. (aub)'abba(a u b) For each of the following languages, find a regular expression that describes its strings. (Use- fa,b).) 2. a. All strings that do not begin with aa