The Confluence Problem for Flat TRSs

We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each rewrite rule are at most one. Key words: Term rewriting system, Decision problem, Confluence, Flat.

• Type: Conference
• Year: 2006
• Where: AISC
• Authors: Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard
• Keywords: AISC 2006, Artificial Intelligence, Flat Trss, Right-hand Sides, Term Rewriting System