(Solved): 1.1 Consider the regular expression: (a+b)*ab(a+b)^(*)+b^(*)a^(*) Describe in words the language gen ...

1.1 Consider the regular expression: (a+b)*ab(a+b)^(*)+b^(*)a^(*) Describe in words the language generated by the presented regular expression. 1.2 Provide a regular expression that generates the language consisting of all words of even length. 1.3 Provide a regular expression that generates the language consisting of all words without a double b. Thus, the bb-substring should not occur. 1.4 Does the regular expression (b+\Lambda )(ab)^(*)(aab)^(*)(a+\Lambda ) generate the language of all words where the aaa-substring does not occur? Justify your answer. 1.5 Give a regular expression which generates the language of all words containing an aa substring and having only three a 's in total in each word. 1.6 Give a regular expression which generates all words which begin and end with aa or bb and contain at least 4 letters in each word. 1.7 Consider the following regular expression: ,a^(*)((b+bb)aa^(*))^(*)(\Lambda +b+bb)aaaa^(*)(\Lambda +b+bb) Can the regular expression generate the word abbaaabaabbaaab? Justify your answer.