Question

Find context-free grammars for the language l={anbmck :k≠n+m}
(with n ≥ 0, m ≥ 0, k ≥ 0).​

Answer 1

Answer:

A language is context-free if it is generated by a CFG. For compactness, we write S → 0S1 | ε where the vertical bar means or. Let P be language of palindromes with alpha- bet {a,b}. One can determine a CFG for P by finding a recursive decomposition.

hope it helps you

Answer 2

For (c) what I have done is

Since k=m+n

So L= anbmcn+m 

L= anbmcmcn

So, productions of the above language are :

S--> aSc | aAc | ∊

A--> bAc | ∊