scientific article
From MaRDI portal
Publication:2730723
zbMath0989.03036MaRDI QIDQ2730723
Michaël Rusinowitch, Rakesh M. Verma, Denis Lugiez
Publication date: 14 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decision problemsword problemdecidabilityconfluencerewrite systemsequational theorypolynomial-time reductions
Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items
Uniqueness of Normal Forms for Shallow Term Rewrite Systems ⋮ Deciding confluence of certain term rewriting systems in polynomial time ⋮ The reachability and related decision problems for monadic and semi-constructor TRSs ⋮ Component-Based Security Policy Design with Colored Petri Nets ⋮ A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems ⋮ New Undecidability Results for Properties of Term Rewrite Systems ⋮ Unnamed Item ⋮ Reachability and confluence are undecidable for flat term rewriting systems ⋮ Algorithms and reductions for rewriting problems. II. ⋮ Confluence problems for trace rewriting systems
This page was built for publication:
