Dummy elimination: Making termination easier

DOI10.1007/3-540-60249-6_56MaRDI QIDQ5055895zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1614705
• Dummy elimination in equational rewriting
• Termination of term rewriting: Interpretation and type elimination
• Transforming termination by self-labelling
• Elimination transformations for associative-commutative rewriting systems

Cites work

• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1380897 (Why is no real title available?)
• A complete characterization of termination of 0p 1q→1r 0s
• Orderings for term-rewriting systems
• Proving termination with multiset orderings
• Termination by completion
• Termination of rewriting
• Termination of term rewriting: Interpretation and type elimination
• Total termination of term rewriting

Cited in

(9)

• Transforming termination by self-labelling
• A complete characterization of termination of 0p 1q→1r 0s
• Termination modulo equations by abstract commutation with an application to iteration
• scientific article; zbMATH DE number 1614705 (Why is no real title available?)
• 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)