Which of the following option is true, if L1 and L2 are two languages such that L1 ⊆ L2.
(A) If L1 is regular then L2 is regular.
(B) If L1 is CFL then L2 is CFL.
(C) L2 can be regular even if L1 is CFL but not regular.
(D) None of these
Explanation: Take an example of anbn which is CFL and is subset of a*b* which is regular.
Option (C) is correct.
Quiz of this Question
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.