Efficiency of Equivalence Algorithms

  • Michael J. Fischer
Part of the The IBM Research Symposia Series book series (IRSS)


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.


Instruction Sequence Direct Descendant Weighting Rule Weighted Algorithm Unique Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1972

Authors and Affiliations

  • Michael J. Fischer
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations