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 }

.

Follow-Ups:
- Re: languages
  - From: Barb Knox
- Re: languages
  - From: Torben Ægidius Mogensen

References:
- languages
  - From: jason_box
- Re: languages
  - From: Barb Knox