Logic for Programming, Artificial Intelligence, and Reasoning

Volume 6397 of the series Lecture Notes in Computer Science pp 142-156

Characterising Space Complexity Classes via Knuth-Bendix Orders

  • Guillaume BonfanteAffiliated withINRIA-LORIA
  • , Georg MoserAffiliated withInstitute of Computer Science, University of Innsbruck

* Final gross prices may vary according to local VAT.

Get Access


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.