Rigid Tree Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Rigid Tree Automata


We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: RTA can test for equality in subtrees reaching the same rigid state. RTA are able to perform local and global tests of equality between subtrees, non-linear tree pattern matching, and restricted disequality tests as well. Properties like determinism, boolean closure, and several decision problems are studied in detail. In particular, the emptiness problem is shown decidable in linear time for RTA whereas membership of a given tree to the language of a given RTA is NP-complete. Our main result is the decidability of whether a given tree belongs to the rewrite closure of a RTA language under a restricted family of term rewriting systems, whereas this closure is not a RTA language. This result, one of the first on rewrite closure of languages of tree automata with constraints, is enabling the extension of model checking procedures based on finite tree automata techniques. Finally, a comparison of RTA with several classes of tree automata with local and global equality tests, and with dag automata is also provided.
Fichier principal
Vignette du fichier
RTA.pdf (168.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00579001 , version 1 (22-03-2011)



Florent Jacquemard, Francis Klay, Camille Vacher. Rigid Tree Automata. Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.446-457, ⟨10.1007/978-3-642-00982-2_38⟩. ⟨inria-00579001⟩
222 View
179 Download



Gmail Facebook X LinkedIn More