Let sigma = {a, b, c}. Write a grammar that generates the language: L = {aa (bc)^n ac^n + 1: n greater than or equal to 0} Union {waw^R: w elementof {b, c}^+}
Expert Answer
S = A|C
A -> aaBac
B -> bcBac | epsilon
C -> bCb | cCc | bab | cac
These set of rulse will do your job… The rules are quite simple, but if you need explanation, please let me know. I shall try my best to remove all your doubts.