Efficiency of Equivalence Algorithms
The equivalence problem is to determine the finest partition on a set that is consistent with a sequence of assertions of the form “x ≡ y”. A strategy for doing this on a computer processes the assertions serially, maintaining always in storage a representation of the partition defined by the assertions so far encountered. To process the command “x ≡ y”, the equivalence classes of x and y are determined. If they are the same, nothing further is done; otherwise the two classes are merged together.
KeywordsInstruction Sequence Direct Descendant Weighting Rule Weighted Algorithm Unique Node
Unable to display preview. Download preview PDF.