P, Q, R are three languages. If P & R are regular and if PQ=R, then

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

Q. P, Q, R are three languages. If P & R are regular and if PQ=R, then

(A) Q has to be regular
(B) Q cannot be regular
(C) Q need not be regular
(D) Q has to be a CFL

💬 Discuss

✅ Correct Answer: (C) Q need not be regular

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

697

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate