Dummy elimination: Making termination easier
From MaRDI portal
Publication:5055895
DOI10.1007/3-540-60249-6_56zbMATH Open1503.68107OpenAlexW2112820621MaRDI QIDQ5055895FDOQ5055895
Authors: 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
Recommendations
Cites Work
- Termination of term rewriting: Interpretation and type elimination
- Proving termination with multiset orderings
- Orderings for term-rewriting systems
- Termination of rewriting
- A complete characterization of termination of 0p 1q→1r 0s
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination by completion
- Total termination of term rewriting
Cited In (9)
- Transforming termination by self-labelling
- A complete characterization of termination of 0p 1q→1r 0s
- Title not available (Why is that?)
- Termination modulo equations by abstract commutation with an application to iteration
- On the termination of Russell's description elimination algorithm
- Termination of term rewriting using dependency pairs
- Termination of constructor systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Dummy elimination in equational rewriting
This page was built for publication: Dummy elimination: Making termination easier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055895)
