Optimization of rewriting and complexity of rewriting

DOI10.1007/3-540-53162-9_51zbMath1493.68175OpenAlexW1577544887MaRDI QIDQ5096207

Ke Li

Publication date: 16 August 2022

Published in: Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53162-9_51

Mathematics Subject Classification ID

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

Uses Software

• NARROWER

Cites Work

• Termination of rewriting
• Complexity of matching problems
• Completion of a Set of Rules Modulo a Set of Equations
• Optimization by non-deterministic, lazy rewriting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization of rewriting and complexity of rewriting