Skip to Main content Skip to Navigation
Reports

On relationship between term rewriting systems and regular tree languages

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00075286
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 5:52:46 PM
Last modification on : Thursday, February 11, 2021 - 2:48:31 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:19:18 PM

Identifiers

  • HAL Id : inria-00075286, version 1

Collections

Citation

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

Share

Metrics

Record views

138

Files downloads

184