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.

💬 Discuss

✅ Correct Answer: (C) Any regular languages have an equivalent CFG.

Published by Mr. Dubey ⭐ 111.54K Points at 18-Sep-2023 04:33 pm in Theory of Computation

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

425

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate