Theory of computation


#1

let G=({S,C},{a,b},P,S), where P consists of S->aCa,C->aCa | b.
fing L(G)


#2

Solution:
S->aCa->aba. so aba
S->aCa now S->aCa
S->aaCaa
S->anCan now C->b
S->anban
here an means n is superscript of a.
so L(G) is {anban|n>1}