Solved

Which of the Following Statement Is True

Question 12

Multiple Choice

Which of the following statement is true?


A) All languages can be generated by CFG
B) The number of symbols necessary to simulate a Turing Machine(TM) with m symbols and n states is mn.
C) Any regular languages have an equivalent CFG.
D) The class of CFG is not closed under union.

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

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

Q13: Let L be any infinite regular language,

Q14: Recursively enumerable languages are not closed under<br>A)Complementation<br>B)Union<br>C)Intersection<br>D)None

Q15: Which of the following assertions about Turing

Q16: The regular expression have all strings in

Q17: For s ? (0+1)* let d(s) denote