MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
The language L ={ai2bi|i>=0} is:
1.
The language L ={ai2bi|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 ={ai2bi|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. 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:S-> 0S1|01
CFGs are more powerful than:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies