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:
Verified
Q11: Recursively enumerable languages are not closed under:
A)Union
B)Intersection
C)Complementation
D)Concatenation
Q12: Let L1 be a recursive language, and
Q13: Let S be an NP-complete problem, Q
Q14: For s ? (0+1)* let d(s) denote
Q15: A FSM can be considered, having finite
Q17: Recursively enumerable languages are not closed under
A)Complementation
B)Union
C)Intersection
D)None
Q18: The following CFG is in
S ? Abb
B
Q19: The languages -------------- are the examples of
Q20: Let L be any infinite regular language,
Q21: Languages are proved to be regular or
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents