MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
Which of the following strings is not generated...
1.
Which of the following strings is not generated by the given grammar:S->SaSbS|e
A.
aabb
B.
abab
C.
abaabb
D.
None of the mentioned
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The following denotion belongs to which type of language:G=(V, T, P, S)
abb*c denotes which of the following?
Which of the following strings is not generated by the given grammar:S->SaSbS|e
Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.a) (a+b+ab+ba+aa+bb+aba+bab+abab+baba)*b) (bbbb+aaa
Which of the following strings do not belong the given regular expression?(a)*(a+cba)
A language is accepted by a push down automata if it is:a) regularb) context freec) both (
Which of the following is analogous to the following?:NFA and NPDA
THE_FOLLOWING_DENOTION_BELONGS_TO_WHICH_TYPE_OF_LANGUAGE:?$
ABB*C_DENOTES_WHICH_OF_THE_FOLLOWING??$
Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.
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