scientific article
From MaRDI portal
Publication:2723905
zbMath0964.68073MaRDI QIDQ2723905
Yuichi Kaji, Toshinori Takai, Hiroyuki Seki
Publication date: 8 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Unnamed Item ⋮ Right-linear half-monadic term rewrite systems ⋮ Losing recognizability ⋮ Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy ⋮ Descendants of a recognizable tree language for sets of linear monadic term rewrite rules ⋮ Complete symbolic reachability analysis using back-and-forth narrowing ⋮ Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting ⋮ Unnamed Item ⋮ Some decidability results on one-pass reductions ⋮ Decidability for left-linear growing term rewriting systems. ⋮ Term rewriting restricted to ground terms. ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings ⋮ Tree automata for rewrite strategies ⋮ Symbol different term rewrite systems ⋮ Normalization properties for shallow TRS and innermost rewriting ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Decidable call-by-need computations in term rewriting ⋮ Murg term rewrite systems ⋮ Reachability analysis over term rewriting systems ⋮ Termination criteria for tree automata completion ⋮ Undecidable properties of flat term rewrite systems ⋮ Unique Normalization for Shallow TRS ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Context-sensitive rewriting strategies ⋮ Non-linear rewrite closure and weak normalization
This page was built for publication:
