This isn't homework.
Prove or dis-prove the statement: If $R$ is a regular language and both $L$ \ $R$ and $L \cup R$ are context-free, then $L$ is context-free.
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|
Take $R = A^*$, where $A$ is your alphabet. |
|||
|
|
