Characterizing confluence by rewrite closure and right ground term rewrite systems

DOI10.1007/S00200-004-0148-6zbMATH Open1112.68078OpenAlexW2051991815MaRDI QIDQ1885352FDOQ1885352

Authors: Guillem Godoy, Ashish Tiwari, Rakesh M. Verma 

Publication date: 28 October 2004

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-004-0148-6

Recommendations

• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Automated Reasoning
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 165818
• scientific article; zbMATH DE number 3928342

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (6)

• Title not available (Why is that?)
• Non-linear rewrite closure and weak normalization
• Murg term rewrite systems
• New Undecidability Results for Properties of Term Rewrite Systems
• Title not available (Why is that?)
• Automated Reasoning

This page was built for publication: Characterizing confluence by rewrite closure and right ground term rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885352)