Dummy elimination: Making termination easier
From MaRDI portal
Publication:5055895
DOI10.1007/3-540-60249-6_56zbMath1503.68107OpenAlexW2112820621MaRDI QIDQ5055895
Maria C. F. Ferreira, Hans Zantema
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60249-6_56
Related Items (6)
A complete characterization of termination of 0p 1q→1r 0s ⋮ Termination of constructor systems ⋮ Dummy elimination in equational rewriting ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Termination of term rewriting using dependency pairs ⋮ Transforming termination by self-labelling
Cites Work
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Termination by completion
- Termination of rewriting
- Termination of term rewriting: Interpretation and type elimination
- Proving termination with multiset orderings
- Total termination of term rewriting
- A complete characterization of termination of 0p 1q→1r 0s
This page was built for publication: Dummy elimination: Making termination easier
