Tree Automata with Memory, Visibility and Structural Constraints
Tree automata with one memory have been introduced in 2001. They generalize 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 Madhusudan 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, inclusion and universality are decidable for VTAM. Moreover, we propose an extension of VTAM whose transitions may be constrained by structural equality and disequality tests between memories, and show that this extension preserves the good closure and decidability properties.
- 1.Alur, R., Chaudhuri, S., Madhusudan, P.: Visibly pushdown tree languages (2006), Available on http://www.cis.upenn.edu/~swarat/pubs/vptl.ps
- 3.Bogaert, B., Tison, S.: Equality and Disequality Constraints on Direct Subterms in Tree Automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 161–171. Springer, Heidelberg (1992)Google Scholar
- 5.Comon, H., et al.: Tree Automata Techniques and Applications (1997), http://www.grappa.univ-lille3.fr/tata
- 7.Comon-Lundh, H., Jacquemard, F., Perrin, N.: Tree automata with memory, visibility and structural constraints. Technical Report LSV-07-01, Laboratoire Spécification et Vérification (Jan. 2007)Google Scholar
- 9.Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science, vol. B, pp. 243–320. Elsevier, Amsterdam (1990)Google Scholar
- 12.Jensen, T., Métayer, D.L., Thorn, T.: Verification of control flow based security policies. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 89–103. IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
- 13.Kapur, D.: Constructors can be Partial Too. In: Automated reasoning and its applications: essays in honor of Larry Wos, MIT Press, Cambridge (1997)Google Scholar