Transforming Prefix-Constrained or Controlled Rewrite Systems

International audienceWe present two techniques for transforming any prefix-constrained and any controlled term rewrite system into an ordinary rewrite system.We prove that both transformations preserve the rewrite computations, and preserve termination.In this way, prefix-constrained rewriting and controlled rewriting can be run, and termination can be checked, thanks to the usual techniques and tools for ordinary rewriting