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

fing L(G)

# Theory of computation

Solution:

S->aCa->aba. so aba

S->aCa now S->aCa

S->aaCaa

S->a`n`

Ca`n`

now C->b

S->a`n`

ba`n`

here a`n`

means n is superscript of a.

so L(G) is {a`n`

ba`n`

|n>1}