The complexity of equivalence and containment for free single variable program schemes
Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial time algorithm for deciding equivalence of two free schemes, provided one of them has the predicates appearing in the same order in all executions, is given. However, the ordering of a free scheme is shown to lead to an exponential increase in size.
KeywordsPolynomial Time Polynomial Time Algorithm Function Symbol Equivalence Problem Boolean Variable
Unable to display preview. Download preview PDF.
- 1.A.V. Aho, J.E. Hopcroft, J.D. Ullman: "The Design and Analysis of Algorithms", Addison-Wesley Publishing Company, 1974.Google Scholar
- 2.A.V. Aho and J.D. Ullman: "The Theory of Parsing, Translation, and Compiling", Volume I: Parsing, Prentice-Hall, Inc., Englewood Cliffs, N.J. 1972.Google Scholar
- 3.R.L. Constable, H.B. Hunt III, S. Sahni: "On the Computational Complexity of Scheme Equivalence", Proc. Eights An. Princeton Conf. on Information Sciences and Systems, Princeton University, 1974. Also submitted to SIAM J. Computing.Google Scholar
- 4.S.A. Greibach: "Theory of Program Structures: Schemes, Semantics, Verification", Lecture Notes in Computer Science 36, Springer-Verlag, 1975.Google Scholar
- 5.Z. Manna: "Mathematical Theory of Computation", McGraw-Hill Inc. 1974.Google Scholar