CSE GATE 2007 Question No 30 Theory of Computation - Context Free Grammars and Push-down Automata

Question No. 30 CSE | GATE 2007

The language L = {0ⁱ21ⁱ | i ≥ 0} over the alphabet {0, 1, 2} is:

(A) not recursive
(B) is recursive and is a deterministic CFL
(C) is a regular language
(D) is not a deterministic CFL but a CFL

Answer : (B) is recursive and is a deterministic CFL

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

Comments

48jQiw http://pills2sale.com/ levitra nizagara

Posted on 18/10/2020 21:24:25 by dobsonz

3Hya9Y 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 01:01:05 by dobson

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

Posted on 12/12/2020 20:27:37 by johnan

7MRbV0 https://writemyessayforme.web.fc2.com/

Posted on 13/12/2020 04:17:36 by dobson

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

Posted on 15/12/2020 05:17:37 by dobson

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

Posted on 09/01/2021 11:30:31 by dobson

S4kK9m http://waldorfdollshop.us/ waldorf doll

Posted on 09/01/2021 15:49:10 by johnanz

GATE Papers >> CSE >> 2007 >> Question No 30

Answer : (B) is recursive and is a deterministic CFL

Questions of Context Free Grammars and Push-down Automata

About

Follow Us On

Contact Us

Search in Website