MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
ABB*C_DENOTES_WHICH_OF_THE_FOLLOWING??$..
1.
ABB*C_DENOTES_WHICH_OF_THE_FOLLOWING??$
A.
{abnc|n=0}
B.
{abnc|n=1}
C.
{anbc|n=0}
D.
{abcn|n>0}
Answer» C. {anbc|n=0}
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