On the ground reducibility problem for word rewriting systems with variables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

On the ground reducibility problem for word rewriting systems with variables

Gregory Kucherov
Michaël Rusinowitch

Abstract

Given a word rewriting system with variables R and a word with variables w the question we are interested in is whether all the instances of w obtained by substituting its variables by non-empty words are reducible by R. We prove this problem to be generally undecidable even for a very simple word w, namely axa where a is a letter and x a variable. When R is left-linear, the question is decidable for arbitrary (linear or non-linear).

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1892.pdf (665.86 Ko) Télécharger le fichier

Dates and versions

inria-00074779 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074779 , version 1

Cite

Gregory Kucherov, Michaël Rusinowitch. On the ground reducibility problem for word rewriting systems with variables. [Research Report] RR-1892, INRIA. 1993. ⟨inria-00074779⟩
76 View
85 Download

Share

Gmail Facebook Twitter LinkedIn More