POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS
From MaRDI portal
Publication:5389155
DOI10.4230/LIPIcs.RTA.2010.357zbMath1236.68155OpenAlexW1673970604MaRDI QIDQ5389155
Publication date: 25 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_1e7e.html
weighted automatafinite domain constraintsmatrix interpretationambiguity of automataderivational complexity of rewriting
Related Items (6)
Unnamed Item ⋮ Uncurrying for termination and complexity ⋮ Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems ⋮ A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems ⋮ Derivational complexity and context-sensitive Rewriting ⋮ Analyzing innermost runtime complexity of term rewriting by dependency pairs
This page was built for publication: POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS