The Confluence Problem for Flat TRSs
From MaRDI portal
Publication:5302902
DOI10.1007/11856290_8zbMath1156.68433OpenAlexW1499960275MaRDI QIDQ5302902
Michio Oyamaguchi, Florent Jacquemard, Ichiro Mitsuhashi
Publication date: 15 January 2009
Published in: Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00579010/file/MOJ-aisc06.pdf
Related Items
Uniqueness of Normal Forms for Shallow Term Rewrite Systems ⋮ Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent ⋮ Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ 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 ⋮ Conditions for confluence of innermost terminating term rewriting systems ⋮ Undecidable Properties on Length-Two String Rewriting Systems
