Skip to Main content Skip to Navigation

Algorithms and Reductions for Rewriting Problems

Rakesh M. Verma 1 Michaël Rusinowitch 1 Denis Lugiez 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we initiate a systematic study of polynomial-time reductions for some basic decision problems of rewrite systems. We then give a polynomial-time algorithm for Unique-normal-form property of ground systems for the first time. Next we prove undecidability of these problems for string rewriting using our reductions. Finally, we prove partial decidability results for Confluence of commutative semi-thue systems. The Confluence and Unique-normal-form property are also shown Expspace-hard for commutative semi-thue systems.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:47:24 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:46:22 PM


  • HAL Id : inria-00073431, version 1



Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez. Algorithms and Reductions for Rewriting Problems. [Research Report] RR-3258, INRIA. 1997, pp.21. ⟨inria-00073431⟩



Record views


Files downloads