The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the dominator tree in a modified circuit graph which provides an exact bound on the complexity of computation. The uniqueness of the cover extends to multiple output circuits, and the complexity of finding it is shown to be quadratic in the number of nodes in the circuit graph. By prior determination of the maximal supergate cover, unnecessary duplication in computation of testability values can be avoided.

]]>What are the essential parameters of a document interpretation system? What needs to be known before undertaking the design or purchase of such a system? What is the interrelationship of the client, the document, and the desired information? In other words, what is the range of issues of possible interest to our research community? In order to highlight the tacit assumptions implicit in the document analysis literature, we will start with tabula rasa and invite the workshop participants to join us in a game of Twenty Questions.

]]>