A term rewriting characterization of the functions computable in polynomial space

DOI10.1007/S001530200002zbMath1022.03013OpenAlexW2045962051MaRDI QIDQ1407521

Isabel Oitavem

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530200002

zbMATH Keywords

term rewritingrecursive functionsrecursion schemespolyspace functions

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Unnamed Item

This page was built for publication: A term rewriting characterization of the functions computable in polynomial space