Solved

Let P Be a Regular Language and Q Be Context-Free

Question 32

Multiple Choice

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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Unlock this Answer For Free Now!

View this answer and more for free by performing one of the following actions

qr-code

Scan the QR code to install the App and get 2 free unlocks

upload documents

Unlock quizzes for free by uploading documents