Subset problem in undecidable for DCFL's , now consider the following argument given below.
G1 and G2 are DCFL,the algorithm to test whether L(G1) is a subset of L(G2) or not.
- Check for equivalence (L(G1)=L(G2)) ,if yes then we're done else go to Step 2
- Compute L= L(G1) ᑚ L(G2) and test whether L=L(G1) ?
the second step looks quite convincing and it seems like that the above procedure did solve the subset problem. So my question is that,if the above procedure is not correct how can i prove it ?