scientific article; zbMATH DE number 5722524

MaRDI QIDQ3567845zbMATH OpenFDO

Authors Naohi Eguchi

Publication date 17 June 2010

zbMATH Keywords

safe nested recursionspace complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42)

Recommendations

• A PVS theory for term rewriting systems
• Computer Science Logic
• An implicit characterization of PSPACE
• A term rewriting characterization of the functions computable in polynomial space
• On characterizations of the class PSPACE/poly
• scientific article; zbMATH DE number 2006637
• Publication:4207592
• scientific article; zbMATH DE number 2182433
• scientific article; zbMATH DE number 5593317
• PSPACE-completeness of reversible deterministic systems

Cited in

(4)

• scientific article; zbMATH DE number 2006637 (Why is no real title available?)
• Characterising space complexity classes via Knuth-Bendix orders
• Term rewriting characterisation of LOGSPACE for finite and infinite data
• Formalizing termination proofs under polynomial quasi-interpretations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567845)