Characterising Space Complexity Classes via Knuth-Bendix Orders

  • Guillaume Bonfante
  • Georg Moser
Conference paper

DOI: 10.1007/978-3-642-16242-8_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6397)
Cite this paper as:
Bonfante G., Moser G. (2010) Characterising Space Complexity Classes via Knuth-Bendix Orders. In: Fermüller C.G., Voronkov A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg

Abstract

We study three different space complexity classes: LINSPACE, PSPACE, and ESPACE and give complete characterisations for these classes. We employ rewrite systems, whose termination can be shown by Knuth Bendix orders. To capture LINSPACE, we consider positively weighted Knuth Bendix orders. To capture PSPACE, we consider unary rewrite systems, compatible with a Knuth Bendix order, where we allow for padding of the input. And to capture ESPACE, we make use of a non-standard generalisation of the Knuth Bendix order.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Guillaume Bonfante
    • 1
  • Georg Moser
    • 2
  1. 1.INRIA-LORIANancyFrance
  2. 2.Institute of Computer ScienceUniversity of InnsbruckAustria

Personalised recommendations