MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory Questions and Answers
→
Ambiguous Grammar in Automata Theory Questions and Answers
→
L={0i1j2k | j>i+k}..
1.
L={0i1j2k | j>i+k}
A.
Which of the following satisfies the language?
B.
0111100
C.
011100
D.
0001100
E.
0101010
Answer» B.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
L={0i1j2k | j>i+k}
Which among the following is the correct grammar for the given language?
Which among the following is a CFG for the given Language:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply