Term Rewriting and Applications

DOI10.1007/b135673zbMath1078.68041OpenAlexW2504734884MaRDI QIDQ5703845

Jean-Yves Marion, Guillaume Bonfante, Jean-Yves Moyen

Publication date: 11 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Closed-form upper bounds in static cost analysis, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Automated Implicit Computational Complexity Analysis (System Description), On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting, Complexity Analysis by Rewriting