A Note on the Precision of the Tree Automata Completion - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2014

A Note on the Precision of the Tree Automata Completion

Thomas Genet

Abstract

Tree Automata Completion is an algorithm over-approximating sets of terms reachable by rewriting. Precision of completion is conditioned by the, so-called, R/E-coherence property of the initial tree automaton. This paper shows that, in the particular case of functional TRS, this restriction can easily be removed. First, we prove that there always exists an equivalent R/E-coherent tree automaton. Second, we show how to approximate this equivalent tree automaton using completion itself and the Timbuk tool.
Fichier principal
Vignette du fichier
Notes.pdf (530.43 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01091393 , version 1 (05-12-2014)

Identifiers

  • HAL Id : hal-01091393 , version 1

Cite

Thomas Genet. A Note on the Precision of the Tree Automata Completion. [Research Report] IRISA. 2014, pp.13. ⟨hal-01091393⟩
170 View
53 Download

Share

Gmail Mastodon Facebook X LinkedIn More