Tree Automata with Global Constraints

Abstract : A tree automaton with global equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, it is equipped with an (dis)equality relation on states, so that whenever two subtrees t and t' evaluate (in an accepting run) to two states which are in the (dis)equality relation, they must be (dis)equal. We study several properties of TAGEDs, and prove decidability of emptiness of several classes. We give two applications of TAGEDs: decidability of an extension of Monadic Second Order Logic with tree isomorphism tests and of unification with membership constraints.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00292027
Contributor : Emmanuel Filiot <>
Submitted on : Monday, June 8, 2009 - 1:43:07 PM
Last modification on : Thursday, July 25, 2019 - 8:50:06 AM
Long-term archiving on : Wednesday, September 22, 2010 - 1:01:04 PM

Files

dlt-full.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00292027, version 2

Collections

Citation

Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata with Global Constraints. 12th International Conference on Developments in Language Theory (DLT), Sep 2008, Kyoto, Japan. pp.314-326. ⟨inria-00292027v2⟩

Share

Metrics

Record views

531

Files downloads

965