Home › Previous year questions › GATE 2009 CS › Question 12GATE 2009 CS – Question 12 Theory of Computation · Context-Free Grammars and Pushdown Automata · 1 mark · Multiple choice
The grammar $S\to aSa\mid bSb\mid a\mid b$ generates which language over {a, b}?
all palindromes. all odd-length palindromes. strings that begin and end with the same symbol. all even-length palindromes. Practise this question in The GATE Grind →
Show answer and explanation Correct answer: (B) all odd-length palindromes.
Explanation We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Context-Free Grammars and Pushdown Automata questions GATE 2009 CS Q16 – Which one of the following is FALSE? GATE 2008 CS Q50 – Which statements are true? I. Every left-recursive grammar can be converted to… GATE 2008 CS Q51 – Match E: declarations precede identifier use; F: formal and actual parameter counts agree;… GATE 2007 CS Q30 – Over 0, 1, 2, L=\0i21i i0\ is GATE 2007 CS Q78 – CFG has nonterminals S, A, B, terminals a, b, start S, rules S aB bA, B b bS aBB, A a aS… GATE 2007 CS Q79 – CFG has nonterminals S, A, B, terminals a, b, start S, rules S aB bA, B b bS aBB, A a aS… All Context-Free Grammars and Pushdown Automata questions →