A term-rewriting characterization of PSPACE
Logic
2012-01-04 v1 Logic in Computer Science
Abstract
Isabel Oitavem has introduced a term rewriting system (TRS) which captures the class FPS of polynomial-space computable functions. We propose an alternative TRS for FPS. As a consequence, it is obtained that FPS is the smallest class containing certain initial functions and closed under specific operations. It turns out that our characterization is relatively simple and suggests an uniform approach to the space-complexity.
Cite
@article{arxiv.1201.0562,
title = {A term-rewriting characterization of PSPACE},
author = {Naohi Eguchi},
journal= {arXiv preprint arXiv:1201.0562},
year = {2012}
}
Comments
In: T. Arai, C. T. Chong, R. Downey, J. Brendle, Q. Feng, H. Kikyo and H. Ono, editors, Proceedings of the 10th Asian Logic Conference 2008, World Scientific, 2010