engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider the following grammar
S -> aSb|bSa|aSa|bSb|c
Language not accepted by the grammar are\is1
∑* - {ww | w ∈ {a,b,c}*}
2
{wwR | w ∈ {a,b,c}*}
3
{w1cw2 | wi ∈ {a,b,c}*}
4
{ AcB | A,B ∈ {a,b}*}