Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems
نویسندگان
چکیده
منابع مشابه
Strongly Sequential and Inductively Sequential Term Rewriting Systems
outermost-needed strategy index reduction Informatik II, RWTH Aachen, D-52056 Aachen, Germany, . Work partially supported by DFG (under grant Ha 2457/1-1) and Acci on Integrada. DSIC, U.P. de Valencia, Camino de la Vera s/n, Apdo. 22012, E-46071 Valencia, Spain, . Work partially supported by EEC-HCM grant ERBCHRXCT940624, Bancaixa (Bancaja-Europa grant), Acci on Integrada (HA19970073) and CICYT...
متن کاملTermination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bounded uniform termination, the k-bounded termination, the inverse k-bounded uniform, and the inverse kbounded problems are decidable. The k-bounded class (BO(k)) is, by definition, the set of linear systems for which e...
متن کاملEecient Parallel Execution and Transformation of Forward Branching Term Rewriting Systems
Sekar and al. found an eecient parallel reduction strategy for the class of path sequential term rewriting systems, which follow the constructor discipline. In this article, we present an overview of a parallel reduction strategy for the extended class of nonconstructor path sequential systems. We then deene formally this class and show some of its properties. Moreover, we give a transformation...
متن کاملAn Efficient Algorithm for Recognizing the Forward-Branching Class of Term-Rewriting Systems
We present an algorithm for recognizing the forward-branching (FE) [Str89] class of term-rewriting systems. The algorithm is an improvement over a previous algorithm reported in [DS91] and [DS90] with a complexity proof in [Dur94]. The time comple)(ity of the algorithm ln [Dur94) is OC~:::, ln; l) but was reported to be O(('E; ln; l)2), and the space compl€Dty is O(('E; ln,l}2) . We improve on ...
متن کاملConstructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof
In 8], Thatte demonstrated the possibility of simulating an orthogonal TRS with a left-linear constructor system obtained from the original system via a simple transformation. The class of strongly sequential systems (SS) was deened in 3]. In 2], we have deened the class of constructor equivalent systems (CE) for which Thatte's transformation preserves strong sequentiality; in that same article...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1994
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1050