Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat equational theory between brother subterms and between subterms whose positions are defined by the states reached during a computation. In particular, TABG 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 TABG. This solves, in particular, the open question of the 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 equivalence classes of subterms (modulo a given flat equational theory) reaching some state during a computation. We also adapt the model to unranked ordered terms. As a consequence of our results for TABG, 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]  Thomas Schwentick,et al.  Automata for XML - A survey , 2007, J. Comput. Syst. Sci..

[2]  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..

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

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

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

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

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

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

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

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

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

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

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

[14]  Ralf Treinen,et al.  Predicate Logic and Tree Automata with Tests , 2000, FoSSaCS.

[15]  Jean-Pierre Jouannaud,et al.  Syntacticness, Cycle-Syntacticness, and Shallow Theories , 1994, Inf. Comput..

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

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

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

[19]  Robert Nieuwenhuis.  Basic Paramodulation and Decidable Theories (Extended Abstract) , 1996, LICS 1996.

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

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

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

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

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

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

[26]  Joachim Niehren,et al.  Tree Automata , 2005 .

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

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

[29]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[30]  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.