Publication:4263809
From MaRDI portal
zbMath0934.03052MaRDI QIDQ4263809
Jean-Yves Marion, Hélène Touzet, Guillaume Bonfante, Adam Cichon
Publication date: 22 September 1999
03D15: Complexity of computation (including implicit computational complexity)
68Q42: Grammars and rewriting systems
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Relative undecidability in term rewriting. I: The termination hierarchy, Relative undecidability in term rewriting. II: The confluence hierarchy, Applications and extensions of context-sensitive rewriting, Derivational complexity and context-sensitive Rewriting, On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting