51. Let P be a regular language and Q be context-free language such that

By ayush goel in 7 Oct 2023 | 03:29 pm
ayush goel

ayush goel

 Student
Posts: 346
Member since: 21 Sep 2023

51. Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn
n∈ N}). Then which of the following is ALWAYS regular?
A. P ∩ Q
B. P – Q
C. ∑* – P
D. ∑* – Q
7 Oct 2023 | 03:29 pm
0 Likes

Report

Please describe about the report short and clearly.