A term-rewriting characterization of PSPACE

Details A term-rewriting characterization of PSPACE A term-rewriting characterization of PSPACE

2012-01-03

arxiv.org/abs/1201.0562v1

Mathematics

Logic

In: T. Arai, C. T. Chong, R. Downey, J. Brendle, Q. Feng, H. Kikyo and H. Ono, editors, Proceedings of the 10th Asian Logic Co

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A term-rewriting characterization of PSPACE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A term-rewriting characterization of PSPACE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A term-rewriting characterization of PSPACE will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183473