Multiple Choice
The following CFG is in
S ? Abb
B ? bAA
A ? a
B ? b
A) Chomsky normal form but not strong Chomsky normal form
B) Weak Chomsky normal form but not Chomsky normal form
C) Strong Chomsky normal form
D) Greibach normal form
Correct Answer:
Verified
Correct Answer:
Verified
Q2: Consider the following statements about the context
Q3: Let S be an NP-complete problem, Q
Q4: Give a production grammar for the language
Q5: A PC not connected to a network
Q6: A FSM can be considered, having finite
Q8: The part of an FA, where the
Q9: The production Grammar is {S->aSbb,S->abb} is<br>A)type-3 grammar<br>B)type-2
Q10: Regular expression (x/y)(x/y) denotes the set<br>A){xy,xy}<br>B){xx,xy,yx,yy}<br>C){x,y}<br>D){x,y,xy}
Q11: Let SHAM3 be the problem of finding
Q12: Which of the following statement is true?<br>A)All