Q. The set which is not countable if we have ∑ = {a, b}, is

(A) Set of all languages over ∑ accepted by turing machine
(B) Set of all regular languages over ∑
(C) Set of all strings over ∑
(D) Set of all languages over ∑

💬 Discuss

✅ Correct Answer: (D) Set of all languages over ∑

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

👁️

1014

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate