Skip to Main content Skip to Navigation
Journal articles

Tree Automata With Global Constraints

Abstract : We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, they are equipped with an equality relation and a disequality 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 emptiness decidability of for several expressive subclasses of TAGEDs.
Complete list of metadatas
Contributor : Sophie Tison <>
Submitted on : Sunday, October 17, 2010 - 6:21:44 PM
Last modification on : Thursday, June 4, 2020 - 10:40:07 AM

Links full text




Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata With Global Constraints. International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.571-596. ⟨10.1142/S012905411000743X⟩. ⟨hal-00526987⟩



Record views