Computer Science Logic
From MaRDI portal
Publication:5394600
DOI10.1007/11538363zbMath1136.68411OpenAlexW2479351976MaRDI QIDQ5394600
Guillem Godoy, Ashish Kumar Tiwari
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538363
Related Items
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent ⋮ Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent ⋮ First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification ⋮ New Undecidability Results for Properties of Term Rewrite Systems ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Undecidable properties of flat term rewrite systems ⋮ Unique Normalization for Shallow TRS ⋮ Proving Confluence of Term Rewriting Systems Automatically ⋮ Non-linear rewrite closure and weak normalization ⋮ Undecidable Properties on Length-Two String Rewriting Systems
