The Language L Asupisup2bsupisupi0 Is #557
The language L ={a<sup>i</sup>2b<sup>i</sup>|i>=0} is:
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1.
The language L ={ai2bi|i>=0} is:
recursive
deterministic CFL
regular
Two of the mentioned is correct
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
