Automated Complexity Analysis Based on Context-Sensitive Rewriting

DOI10.1007/978-3-319-08918-8_18zbMath1416.68092OpenAlexW1591629320MaRDI QIDQ5170821

Georg Moser, Nao Hirokawa

Publication date: 24 July 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-08918-8_18

zbMATH Keywords

term rewritingcomplexity analysisautomationcontext-sensitive rewriting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items (7)

A combination framework for complexity ⋮ Unnamed Item ⋮ Analysing parallel complexity of term rewriting ⋮ A Perron-Frobenius theorem for deciding matrix growth ⋮ Applications and extensions of context-sensitive rewriting ⋮ Derivational complexity and context-sensitive Rewriting ⋮ A new order-theoretic characterisation of the polytime computable functions

This page was built for publication: Automated Complexity Analysis Based on Context-Sensitive Rewriting