Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

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
Correct answer : Option (C) - Q need not be regular

Share

Discusssion

Login to discuss.