Visibly Tree Automata with Memory and Constraints

Tree automata with one memory have been introduced in 2001. They gener- alize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure properties. We propose a generalization of the visibly pushdown automata of Alur and Madhusu- dan to a family of tree recognizers which carry along their (bottom-up) computation an auxiliary unbounded memory with a tree structure (instead of a symbol stack). In other words, these recognizers, called Visibly Tree Automata with Memory (VTAM) define a subclass of tree automata with one memory enjoying Boolean closure properties. We show in particular that they can be determinized and the problems like emptiness, member- ship, inclusion and universality are decidable for VTAM. Moreover, we propose several extensions of VTAM whose transitions may be constrained by different kinds of tests be- tween memories and also constraints a la Bogaert and Tison. We show that some of these classes of constrained VTAM keep the good closure and decidability properties, and we demonstrate their expressiveness with relevant examples of tree languages.

[1]  Flemming Nielson,et al.  Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi , 2002, SAS.

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

[3]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Jacques Chabin,et al.  Visibly Pushdown Languages and Term Rewriting , 2007, FroCoS.

[5]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems , 1994, Theor. Comput. Sci..

[6]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

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

[8]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[9]  Tomás Vojnar,et al.  Automata-based verification of programs with tree updates , 2009, Acta Informatica.

[10]  Jean H. Gallier,et al.  Tree Pushdown Automata , 1985, J. Comput. Syst. Sci..

[11]  Jayadev Misra,et al.  Powerlist: a structure for parallel recursion , 1994, TOPL.

[12]  Florent Jacquemard,et al.  Ground reducibility is EXPTIME-complete , 2003, Inf. Comput..

[13]  Irène Guessarian,et al.  Pushdown tree automata , 1983, Mathematical systems theory.

[14]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[15]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[16]  Andreas Podelski,et al.  Set constraints with intersection , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

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