Let $L=\{aab\}**\{a,$aba$\}**.$

Use right$-$slashes for the above description to find the minimal automaton, M$,$ of L$.$

Construct a nondeterministic automaton, N$,$ describing L$.$

Use subset construction to find a deterministic automaton, D$,$ describing L$.$

Use right$-$slashes on $D$ as a description of $L$ and find a minimal automaton. Is it the same automaton as M$?$

$3\mathrm{.}40.$ Each part of Figure $3\mathrm{.}38$ shows an NFA. Draw an FA accepting the same

$3\mathrm{.}49.$ Figure $3\mathrm{.}39$ shows FAs $M_1$ and $M_2$ accepting languages $L_1$ and $L_2,$ respectively. Draw NFAs accepting each of the following languages, using the constructions in the proof of Theorem $3\mathrm{.}25.$

a$.L_2^{**}{L}_1$

b$.L_2{L}_1^{**}$

c$.L_1{L}_2(L_2{L}_1{)}^{**}$