fixed the issue. Will look into that further You can get each MapEntry of subset candidate and check if original map contains the same value. If value is a collection, then it has to be compared using DeepCollectionEquality. Here is my code:
help you fix your problem DTDs are really just context-free grammars in disguise. A grammar G represents the set of possible legal strings that comprise the unstated language L(G) that grammar represents. What you are asking is tantamount to determining if you have G1 and G2, whether L(G1) is a subset of L(G2). My language theory is getting rusty and I don't remember if this is computable in general or not, but my guess this is really hard, because you have to demonstrate that an arbitrary derivation in G1 always has a derivation in G2.
it should still fix some issue Well, given two sets A and B, A is a subset of B precisely when their intersection equals A. Since Mathematica has the Intersection function, you can use that. Similarly, you could see whether or not there are any elements in Complement[A,B], etc.
How to determine if one regex is subset of another?
This might help you There are obviously a lot of ways to do this - any logical argument could constitute a valid proof. However, an instructive method of answering this question is to use algorithms to compute an answer to the general question. Two languages are equal if each contains the other. If one language contains another, the difference of the contained language and the containing language is the empty set. Therefore, if two languages A and B are equal, then A \ B and B \ A are both empty; and if A \ B and B \ A are both empty, then A and B must be equal.