The Emptiness Problem for Tree Automata with Global Constraints

We define tree automata with global constraints (TAGC), generalizing the class of tree automata with global equality and disequality constraints (TAGED). TAGC can test for equality and disequality between subterms whose positions are defined by the states reached during a computation. In particular, TAGC can check that all the subterms reaching a given state are distinct. This constraint is related to monadic key constraints for XML documents, meaning that every two distinct positions of a given type have different values. We prove decidability of the emptiness problem for TAGC. This solves, in particular, the open question of decidability of emptiness for TAGED. We further extend our result by allowing global arithmetic constraints for counting the number of occurrences of some state or the number of different subterms reaching some state during a computation. We also allow local equality and disequality tests between sibling positions and the extension to unranked ordered trees. As a consequence of our results for TAGC, we prove the decidability of a fragment of the monadic second order logic on trees extended with predicates for equality and disequality between subtrees, and cardinality.

[1]  Jean H. Gallier,et al.  What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory , 1991, Ann. Pure Appl. Log..

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

[3]  K. Stefansson,et al.  Systems of set constraints with negative constraints are NEXPTIME-complete , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[4]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

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

[6]  Valérie Viet Triem Tong,et al.  Reachability Analysis over Term Rewriting Systems , 2004, Journal of Automated Reasoning.

[7]  Marcin Jurdzinski,et al.  Alternation-free modal mu-calculus for data trees , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[8]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[9]  Michaël Rusinowitch,et al.  Closure properties and decision problems of dag automata , 2005, Inf. Process. Lett..

[10]  Tayssir Touili,et al.  On Computing Reachability Sets of Process Rewrite Systems , 2005, RTA.

[11]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

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

[13]  Denis Lugiez,et al.  XML schema, tree logic and sheaves automata , 2003, Applicable Algebra in Engineering, Communication and Computing.

[14]  Christof Löding,et al.  Unranked Tree Automata with Sibling Equalities and Disequalities , 2007, ICALP.

[15]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

[16]  Christof Löding,et al.  On Nondeterministic Unranked Tree Automata with Sibling Constraints , 2009, FSTTCS.

[17]  Makoto Murata,et al.  Hedge automata: a formal model for xml schemata , 1999 .

[18]  Véronique Cortier,et al.  Tree automata with one memory set constraints and cryptographic protocols , 2005, Theor. Comput. Sci..

[19]  Witold Charatonik,et al.  Set constraints with projections are in NEXPTIME , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[20]  Florent Jacquemard,et al.  Rigid Tree Automata , 2009, LATA.

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

[22]  Jean Goubault-Larrecq,et al.  Alternating two-way AC-tree automata , 2007, Inf. Comput..

[23]  Thomas Schwentick,et al.  Automata for XML - A survey , 2007, J. Comput. Syst. Sci..

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

[25]  Sophie Tison,et al.  Some new Decidability Results on Positive and Negative Set Constraints , 1994, CCL.

[26]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .