The language L ={a^i2b^i|i>=0} is:
(a) recursive
(b) deterministic CFL
(c) regular
(d) Two of the mentioned is correct
The question was posed to me by my college director while I was bunking the class.
The query is from DPDA and Ambiguous Grammars topic in portion Push Down Automata of Automata Theory