Section $3\mathrm{.}2$ Question $6$:

START WITH nfas, and then convert to dfas Reduce the number states of the dfa

Find $($draw$)$ dfa's that accept the following languages.

$($b$)$ L$($ab$($a$+$ab$)**($a$+$aa$))$

$($c$)$ L$((($bba$^(**))^(**)$a$)^(**)$