Algorithms and Reductions for Rewriting Problems

Authors:
Rakesh M. Verma;Michael Rusinowitch;Denis Lugiez
Affiliations:
-;-;-
Venue:
Fundamenta Informaticae
Year:
2001

Citing 13
Cited 4

The Church-Rosser property for ground term-rewriting systems is decidable

Theoretical Computer Science
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

Information and Computation
The reachability and joinability problems for right-ground term-rewriting systems

Journal of Information Processing
Rewrite systems

Handbook of theoretical computer science (vol. B)
String-rewriting systems

String-rewriting systems
Some undecidability results for finitely generated Thue congruences on a two-letter alphabet

Fundamenta Informaticae
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Reachability Problem for Ground TRS and Some Extensions

TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Polynomial Time Termination and Constraint Satisfaction Tests

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

The reachability and related decision problems for monadic and semi-constructor TRSs

Information Processing Letters
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems

Fundamenta Informaticae
The reachability and related decision problems for monadic and semi-constructor TRSs

Information Processing Letters
Component-based security policy design with colored Petri nets

Semantics and algebraic specification

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we initiate a study of polynomial-time reductions for some basic decision problems of rewrite systems. We then give a polynomial-time algorithm for the unique-normal-form property of ground systems for the first time. Next we prove undecidability of several problems for a fixed string rewriting system using our reductions. Finally, we prove the decidability of confluence for commutative semi-thue systems. The Confluence and Unique-normal-form property are shown Expspace-hard for commutative semi-thue systems. We also show that there is a family of string rewrite systems for which the word problem is trivially decidable but confluence is undecidable, and we show a linear equational theory with decidable word problem but undecidable linear equational matching problem.