MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
The language L ={a
i
2b
i
|i>..
1.
The language L ={a
i
2b
i
|i>=0} is:
A.
recursive
B.
deterministic CFL
C.
regular
D.
Two of the mentioned is correct
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The language L ={a<sup>i</sup>2b<sup>i</sup>|i>=0} is:
Which of the following are context free language?
Which of the following are non essential while simplifying a grammar?
Statement 1: Ambiguity is the property of grammar but not the language.<br> Statement 2: Same language can have more than one grammar.
Which among the following is incorrect with reference to a derivation tree?
State true or false:<br>S-> 0S1|01
CFGs are more powerful than:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply