MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory Questions and Answers
→
Ambiguous Grammar in Automata Theory Questions and Answers
→
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
L->rLt|tLr|t|r
The language L ={ai2bi|i>=0} is:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply