Term Rewriting and Applications
From MaRDI portal
Publication:5703845
DOI10.1007/b135673zbMath1078.68041MaRDI 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
68Q42: Grammars and rewriting systems
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Complexity Analysis by Rewriting, Closed-form upper bounds in static cost analysis, On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Automated Implicit Computational Complexity Analysis (System Description)