Let $\Sigma = \{a, b\}$ the Context Free Grammar G
$S \rightarrow bS \: \mid \: aM$
$M \rightarrow bS \: \mid aF$
$F \rightarrow aF \mid bF \mid ^{\wedge}$
describes the language of words
- containing aa in them
- with even length
- starting and ending with same letter
- None of the above