6) Find a context-free grammar for L = { w1 c w2 | w1 ≠ w2^R and|w1| = |w2| ≥ 1}, T = {a, b, c}
(note: w1 ≠ w2^R implies that at least one symbol is differentbetween w1 and w2^R)
Expert Answer
An answer will be send to you shortly. . . . .
6) Find a context-free grammar for L = { w1 c w2 | w1 ≠ w2^R and|w1| = |w2| ≥ 1}, T = {a, b, c}
(note: w1 ≠ w2^R implies that at least one symbol is differentbetween w1 and w2^R)
An answer will be send to you shortly. . . . .