Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
نویسندگان
چکیده
منابع مشابه
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
This paper shows that weakly-non-overlapping, non-collapsing and shallow term rewriting systems are confluent, which is a new sufficient condition on confluence for non-left-linear systems.
متن کاملNon-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent
A term is weakly shallow if each defined function symbol occurs either at the root or in the ground subterms, and a term rewriting system is weakly shallow if both sides of a rewrite rule are weakly shallow. This paper proves that non-E-overlapping, weakly-shallow, and noncollapsing term rewriting systems are confluent by extending reduction graph techniques in our previous work [SO10] with tow...
متن کاملNon - E - overlapping and weakly shallow TRSs are confluent ( Extended abstract ) Masahiko Sakai
Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08]. Two decidable subclasses are known: right-linear and shallow TRSs by tree automata techniques [GT05] and terminating TRSs [KB70]. Most of sufficient conditions are for either terminating TRSs [KB70] (extended to TRSs with relative termination [HA11, KH12]) or leftl...
متن کاملConfluent Rewriting systems in Non-Monotonic Reasoning
Non-profit academic project, developed under the open access initiative
متن کاملOn Weakly Confluent Monadic String-Rewriting Systems
Madlener, K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems, Theoretical Computer Science 113 (1993) 119-165. It is investigated as to how far the various decidability results for finite, monadic, and confluent string-rewriting systems can be carried over to the class of finite monadic string-rewriting systems that are only weakly confluent. Here a mon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2010
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.06.015