scientific article; zbMATH DE number 3729436
From MaRDI portal
Publication:3917482
zbMATH Open0465.68009MaRDI QIDQ3917482FDOQ3917482
Authors: Nachum Dershowitz 
Publication date: 1981
Title of this publication is not available (Why is that?)
General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)
Cited In (30)
- Non-Looping String Rewriting
- Derivation trees of ground term rewriting systems.
- Modularity of simple termination of term rewriting systems with shared constructors
- Match-bounds revisited
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Decidable approximations of term rewriting systems
- Title not available (Why is that?)
- Right-linear half-monadic term rewrite systems
- Completeness of combinations of constructor systems
- Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
- Counterexamples to termination for the direct sum of term rewriting systems
- Termination of rewriting
- Termination of term rewriting using dependency pairs
- Jumping and escaping: modular termination and the abstract path ordering
- Termination for the direct sum of left-linear term rewriting systems
- Match-bounded string rewriting systems
- Undecidable properties on length-two string rewriting systems
- Overlap closures do not suffice for termination of general term rewriting systems
- Decidability for left-linear growing term rewriting systems.
- Corrigendum to ``Termination of rewriting
- The Church-Rosser property for ground term-rewriting systems is decidable
- Matrix interpretations for proving termination of term rewriting
- On tree automata that certify termination of left-linear term rewriting systems
- Topics in termination
- On relationship between term rewriting systems and regular tree languages
- Loop detection in term rewriting using the eliminating unfoldings
- On termination of graph rewriting
- Termination of string rewriting proved automatically
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
- Natural termination
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917482)
