$AN$

Context free grammars $($CFG$)$ and their associated languages utilize production rules. Given a grammar $G$ defined by the production rules

$S$aSa$|aBa|$

$BbB|b|$

Show that the language it recognizes is $L(G)=\{a^n{b}^n{a}^n$:$n1\}$

$\backslash$table$[[$Major Topic,$\backslash$table$[[$Blooms$],[$Desigation$]],$Seare$],[$Context$-$Free Grammars,,$]]$

$($d$).$ Given $L_1=\{a,bc,a^2{c}^3\}$ and $L_2=\{ac,c^{2}ba\}$ are the languages over $=\{a,b,c\},$ determine $L_1{L}_2$

$\backslash$table$[[$Major Topic,$\backslash$table$[[$Blooms$],[$Desienation$],[$AP$]],\backslash$table$[[$Score$]]]]$