CSE GATE 2009 Question No 12 Theory of Computation - Context Free Grammars and Push-down Automata

Question No. 12 CSE | GATE 2009

S → aSa|bSb|a|b

The language generated by the above grammar over the alphabet {a,b} is the set of

(A) all palindromes.
(B) all odd length palindromes.
(C) strings that begin and end with the same symbol.
(D) all even length palindromes.

Answer : (B) all odd length palindromes.

GATE 2009 CSE Theory of Computation Context Free Grammars and Push-down Automata

Comments

1YJKrB http://pills2sale.com/ levitra nizagara

Posted on 18/10/2020 19:06:09 by dobsonz

D76kio https://www.quora.com/What-the-top-SEO-keywords-for-essay-you-know/answer/Alan-Smith-1772 write my essay

Posted on 04/12/2020 00:30:45 by dobson

cafRFH http://xnxx.in.net/ xnxx videos

Posted on 12/12/2020 21:39:27 by johnan

AWzXcB https://writemyessayforme.web.fc2.com/

Posted on 13/12/2020 04:48:13 by dobson

V06Kit https://writemyessayforme.web.fc2.com/#writemyessay

Posted on 15/12/2020 05:47:47 by dobson

uotgKZ https://writemyessayforme.web.fc2.com/octavio-paz-essay-day-of-the-dead.html

Posted on 09/01/2021 10:52:04 by dobson

sJZvzf http://waldorfdollshop.us/ waldorf doll

Posted on 09/01/2021 15:08:43 by johnanz

GATE Papers >> CSE >> 2009 >> Question No 12

Answer : (B) all odd length palindromes.

Questions of Context Free Grammars and Push-down Automata

About

Follow Us On

Contact Us

Search in Website