Let L be a DCFL and R is a regular language. Consider the below given problems.
P : Is L ≠ R?
Q : is R ⊂ L?
Choose the correct option.
- Both problems P and Q are decidable.
- Both problems P and Q are undecidable.
- Problem Q is decidable and P is undecidable.
- Problem P is decidable and Q is undecidable.
I understand that Equality problem is decidable and Subset problem is undecidable for DCFL’s, i.e when both languages are DCFL’s.
How do I analyze decidablity for different languages? In this case, for a RL and DCFL.