Abstract
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.
Cite
CITATION STYLE
Fortune, S., Hopcroft, J., & Schmidt, E. M. (1978). The complexity of equivalence and containment for free single variable program schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 62 LNCS, pp. 227–240). Springer Verlag. https://doi.org/10.1007/3-540-08860-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
