Q.

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.
Answer» C. Any regular languages have an equivalent CFG.
2.4k
1
Do you find this helpful?
6

View all MCQs in

Theory of Computation

Discussion

MA

Md abushahma
2 years ago

Study very good
0