On relationship between term rewriting systems and regular tree languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

On relationship between term rewriting systems and regular tree languages

Gregory Kucherov

Abstract

If P is a set of open terms, Red(P) is the set of terms that contain at least a subterm which is an instance of a term in P. The main theorem of this paper says that if L is a regular language of ground terms and P is a finite set of open terms such that L \subseteq Red(P), then there exists a finite set P* such that all the terms of P* are linear instances of terms in P and L \subseteq Red(P*). Applications of this result to ground reducibility of term rewrite systems are also discussed. This work was done while the author was visiting INRIA-Lorraine.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1273.pdf (1.08 Mo) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00075286 , version 1

Cite

Gregory Kucherov. On relationship between term rewriting systems and regular tree languages. [Research Report] RR-1273, INRIA. 1990. ⟨inria-00075286⟩
60 View
103 Download

Share

Gmail Facebook Twitter LinkedIn More