Skip to main content
SpringerLink
Log in

The complexity of equivalence and containment for free single variable program schemes

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 62))

Included in the following conference series:

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.

This research was supported in part by the office of Naval Research under contract N00014-76-0018 and by Aarhus University, Aarhus, Denmark.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Author notes

  1. Erik Meineche Schmidt

    Present address: Computer Science Department, Aarhus University, Aarhus, Denmark

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, New York, USA

    Steven Fortune, John Hopcroft & Erik Meineche Schmidt

Authors
  1. Steven Fortune
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Hopcroft
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik Meineche Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fortune, S., Hopcroft, J., Schmidt, E.M. (1978). The complexity of equivalence and containment for free single variable program schemes. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation