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 expressio n p* q* and Q be { p n qn | n ∈ $\mathbb{N}$}). Then which of the following is ALWAYS regular?
Loading...