This is the best I (actually Google) can do. Proof: https://coq.inria.fr/library/Coq.MSets.MSetGenTree.html
Test: http://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-of-another-binary-tree/ At some point I'll look into this myself, it's a nice challenge. donderdag 28 januari 2016 heeft Pavel Velikhov <[email protected]> het volgende geschreven: > Hmm.. testing subsumption is not as trivial as I thought. Here's a cleaner > way to do it: represent both path expressions as DFAs and then test > subsumption. You'll get DFAs A and B and then test if minimized(B-A) is > empty. > -- W.S. Hager Lagua Web Solutions http://lagua.nl
_______________________________________________ [email protected] http://x-query.com/mailman/listinfo/talk
