Skip to Main content Skip to Navigation
New interface
Conference papers

The Confluence Problem for Flat TRSs

Ichiro Mitsuhashi 1 Michio Oyamaguch 1 Florent Jacquemard 2 
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Florent Jacquemard Connect in order to contact the contributor
Submitted on : Wednesday, March 23, 2011 - 10:29:45 AM
Last modification on : Tuesday, July 5, 2022 - 8:38:34 AM
Long-term archiving on: : Friday, June 24, 2011 - 2:34:00 AM


Files produced by the author(s)



Ichiro Mitsuhashi, Michio Oyamaguch, Florent Jacquemard. The Confluence Problem for Flat TRSs. 8th International Conference Artificial Intelligence and Symbolic Computation (AISC), Sep 2006, Beijing, China. pp.68-81, ⟨10.1007/11856290_8⟩. ⟨inria-00579010⟩



Record views


Files downloads