Handling Left-Quadratic Rules When Completing Tree Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Handling Left-Quadratic Rules When Completing Tree Automata

Abstract

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 left-quadratic. The most common practical case is handled this way.
Fichier principal
Vignette du fichier
bchk08b_ip.pdf (224.76 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00563293 , version 1 (04-02-2011)

Identifiers

Cite

Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. Handling Left-Quadratic Rules When Completing Tree Automata. 2nd Workshop on Reachability Problems in Computational Models - RP'08, Sep 2008, Liverpool, United Kingdom. pp.61--70, ⟨10.1016/j.entcs.2008.12.031⟩. ⟨hal-00563293⟩
163 View
72 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More