scientific article
From MaRDI portal
Publication:3917482
zbMath0465.68009MaRDI QIDQ3917482
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items (30)
Right-linear half-monadic term rewrite systems ⋮ Termination for the direct sum of left-linear term rewriting systems ⋮ On relationship between term rewriting systems and regular tree languages ⋮ Topics in termination ⋮ Decidable approximations of term rewriting systems ⋮ Termination of rewriting ⋮ Corrigendum to ``Termination of rewriting ⋮ Termination of string rewriting proved automatically ⋮ The Church-Rosser property for ground term-rewriting systems is decidable ⋮ Counterexamples to termination for the direct sum of term rewriting systems ⋮ On tree automata that certify termination of left-linear term rewriting systems ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ Decidability for left-linear growing term rewriting systems. ⋮ On termination of graph rewriting ⋮ Overlap closures do not suffice for termination of general term rewriting systems ⋮ Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems ⋮ Matrix interpretations for proving termination of term rewriting ⋮ Proving convergence of self-stabilizing systems using first-order rewriting and regular languages ⋮ Termination of term rewriting using dependency pairs ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ Natural termination ⋮ Modularity of simple termination of term rewriting systems with shared constructors ⋮ Match-bounded string rewriting systems ⋮ Unnamed Item ⋮ Completeness of combinations of constructor systems ⋮ Non-Looping String Rewriting ⋮ Match-bounds revisited ⋮ Derivation trees of ground term rewriting systems. ⋮ Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems ⋮ Undecidable Properties on Length-Two String Rewriting Systems
This page was built for publication:
