engineering recuitment ISRO Scientist Computer Science Mock Test Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
The language generated by following grammar is:
S → aSa | bSb | ε1
an bm n ≥ 1, m ≥ 1
2
Odd length palindrome
3
am bn n ≥ 0, m ≥ 0
4
Even length palindrome