Multiple Choice
Give a production grammar for the language L = {x/x ? (a,b) *, the number of a's in x is multiple of 3}.
A) {S->bS,S->b,S->aA,S->bA,A->aB,B->bB,B->aS,S->a}
B) {S->aS,S->bA,A->bB,B->bBa,B->bB}
C) {S->aaS,S->bbA,A->bB,B->ba}
D) None of the above
Correct Answer:
Verified
Correct Answer:
Verified
Q1: Recursively enumerable languages are not closed under:<br>A)Union<br>B)Intersection<br>C)Complementation<br>D)Concatenation
Q2: Consider the following statements about the context
Q3: Let S be an NP-complete problem, Q
Q5: A PC not connected to a network
Q6: A FSM can be considered, having finite
Q7: The following CFG is in<br>S ? Abb<br>B
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