Question $5(2$ points$)$

$(aaab{)}^{*}(aaba{)}^{*}$ is a regular expression describing the set of ALL even

length strings that don't contain the substring bb$.$

True

False

Question $6(2$ points$)$

$(a^{*}b{)}^{*}=(ab{)}^{*}.$

True

False

Question $7(2$ points$)$

The below state diagram doesn't represent a DFA over $=\{a,b\}.$

True

False

Question $8(4$ points$)$

Choose languages over an alphabet $=\{a,b,c\}.$

$\{a{\}}^{*}$

${}^{*}$

$$

$()$