Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Term rewriting and all that
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Theory of Computation (Texts in Computer Science)
Theory of Computation (Texts in Computer Science)
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
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.