Question $10(2$ points$)$

$\{(ab{)}^{3n}$:$n0\}$ is not a regular language.

True

False

Question $11(4$ points$)$

To which regular set the following regular expression corresponds to$.$

$(aabb{)}^{*}a$

$\{aa,ba,$aaa,aba,baa,bba,dots$\}$

$\{a,$aabba,aaaabbbba,aaaaaabbbbbba,dots$\}$

$\{a,$aaa,bba,aaaaa,aabba,bbaaa,bbbba,dots$\}$

$\{a,$aaa,bba,aaaaa,bbbba,aaaaaaa,bbbbbba,dots$\}$

Question $12(6$ points$)$

Determine whether all the strings in each of the below sets are accepted by the

given DFA.

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

$\{b\}\{a,b{\}}^{*}$

$\{ab{\}}^{*}$

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

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

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

Question $13(2$ points$)$

A set of strings over an alphabet $$ is said to be a context$-$free language if it is

generated by a context$-$free grammar.

True

False