Modular Complexity Analysis for Term Rewriting

DOI10.2168/LMCS-10(1:19)2014zbMath1326.68172arXiv1402.0746OpenAlexW2061056562MaRDI QIDQ5408194

Harald Zankl, Martin Korp

Publication date: 9 April 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0746

zbMATH Keywords

term rewritingcomplexity analysisrelative complexityderivation height

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ Lower bounds for runtime complexity of term rewriting ⋮ A Perron-Frobenius theorem for deciding matrix growth ⋮ Constant runtime complexity of term rewriting is semi-decidable

Uses Software

• CeTA
• Tyrolean

This page was built for publication: Modular Complexity Analysis for Term Rewriting