The emptiness problem for tree automata with at least one global disequality constraint is NP-hard

The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequality constraint, the emptiness problem is NP-hard.

[1]  Jean-Marc Talbot,et al.  Tree Automata with Global Constraints , 2010, Int. J. Found. Comput. Sci..

[2]  Jean-Marc Talbot,et al.  Satisfiability of a Spatial Logic with Tree Variables , 2007, CSL.

[3]  Witold Charatonik,et al.  Automata on DAG representations of finite trees , 1999 .

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Florent Jacquemard,et al.  Rigid tree automata and applications , 2011, Inf. Comput..

[6]  Camille Vacher,et al.  Tree automata with global constraints for the verification of security properties. (Automates d'arbres à contraintes globales pour la vérification de propriétés de sécurité) , 2010 .

[7]  Olga Kouchnarenko,et al.  On Positive TAGED with a Bounded Number of Constraints , 2012, CIAA.

[8]  Guillem Godoy,et al.  Decidable classes of tree automata mixing local and global constraints modulo flat theories , 2013 .

[9]  Max Dauchet,et al.  Transformations de noyaux reconnaissables , 1979, FCT.

[10]  Florent Jacquemard,et al.  Visibly Tree Automata with Memory and Constraints , 2008, Log. Methods Comput. Sci..

[11]  Yohan Boichut,et al.  Rewriting Approximations for Fast Prototyping of Static Analyzers , 2007, RTA.

[12]  Guillem Godoy,et al.  Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints , 2013, Journal of Automated Reasoning.

[13]  Guillem Godoy,et al.  The Emptiness Problem for Tree Automata with Global Constraints , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[14]  Haruo Hosoya.  Foundations of XML Processing: The Tree-Automata Approach , 2010 .

[15]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.