Re: languages



Here is the grammar I came up with.

S-> aBa
B-> b | BB | S | lambda

for the gramma L = {a^nb*a^n : a >= 0 }

.