# formal languages – Find CFG, regular expression and DFA for words containing \$aaa\$ and \$bbb\$

Consider the language $$L subseteq{a, b, c}^*$$ such that $$w in L$$ if and only if $$w$$ contains the substrings $$aaa$$ and $$bbb$$:

a-] Get a grammar that generates this language;

b-] Get a regular expression that generates that language;

c-] Get a finite automaton that recognizes that language.