MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
Which of the following is not context free?
1.
Which of the following is not context free?
A.
{w: nA=nB=nC}
B.
{a*b*c*}
C.
{a<sup>100</sup>b<sup>100</sup>}
D.
All of the mentioned
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
State true or false:Statement: Every context free language can be generated by a grammar which contains no useless non terminals.
Which of the following steps are wrong with respect to infiniteness problem?
Which of the following belong to the steps to prove emptiness?a) Remove useless variableb) Check if a start variable S is uselessc) Both (
Which of the following are valid membership algorithms?a) CYK algorithmb) Exhaustive search parserc) Both (
Which of the following is regular?a) a100b100b) (a+b)*-{a100b100}c) Both (
Which of the following is not a negative property of Context free languages?a) Intersectionb) Complementc) Both (
WHICH_OF_THE_FOLLOWING_STEPS_ARE_WRONG_WITH_RESPECT_TO_INFINITENESS_PROBLEM??$
Which of the following is true for CYK Algorithm?
Which of the following belong to the steps to prove emptiness?
Which of the following are valid membership algorithms?
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