Handling Non Left-Linear Rules When Completing Tree Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2009

Handling Non Left-Linear Rules When Completing Tree Automata

Résumé

This paper addresses the following general problem of tree regular model-checking: decide whether the intersection of R*(L) and Lp is empty, where R* is the reflexive and transitive closure of a successor relation induced by a term rewriting system R, and L and Lp are both regular tree languages. We develop an automatic approximation-based technique to handle this -- undecidable in general -- problem in the case when term rewriting system rules are non left-linear.
Fichier principal
Vignette du fichier
bchk09_ij.pdf (199.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00561373 , version 1 (01-02-2011)

Identifiants

Citer

Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. Handling Non Left-Linear Rules When Completing Tree Automata. International Journal of Foundations of Computer Science, 2009, 20 (5), pp.837--849. ⟨10.1142/S0129054109006917⟩. ⟨hal-00561373⟩
225 Consultations
122 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More