GATE Computer Science (CS) 2011 Solved Paper

Let P be a regular language and Q be a context-free language such that Q ⊆ P. (For example, let P be the language represented by the regular expression p*q*and Q be |pⁿqⁿ | n ϵ N}). Then which of the following is ALWAYS regular?