On Positive TAGED with a Bounded Number of Constraints
Tree Automata With Global Equality Constraints (aka. positive TAGED, or TAGE) are a variety of Bottom-Up Tree Automata, with added expressive power. While there is interest in using this formalism to extend existing regular model-checking frameworks – built on vanilla tree automata – such a project can only be practical if the algorithmic complexity of common decision problems is kept tractable. Unfortunately, useful TAGE decision problems sport very high complexities: Membership is NP-complete, Emptiness and Finiteness are both ExpTime-complete, Universality and Inclusion are undecidable. It is well-known that restricting the kind of equality constraints can have a dramatic effect on complexity, as evidenced by Rigid Tree Automata. However, the influence of the number of constraints on complexity has yet to be examined. In this paper, we focus on three common decision problems: Emptiness, Finiteness and Membership, and study their algorithmic complexity under a bounded number of equality constraints.
KeywordsEquality Constraint Algorithmic Complexity Global Constraint Bounded Constraint Tree Automaton
Unable to display preview. Download preview PDF.
- 1.Barguñó, L., Creus, C., Godoy, G., Jacquemard, F., Vacher, C.: The emptiness problem for tree automata with global constraints. In: LICS, pp. 263–272. IEEE Computer Society (2010)Google Scholar
- 3.Comon-Lundh, H., Jacquemard, F., Perrin, N.: Visibly tree automata with memory and constraints. CoRR abs/0804.3065 (2008)Google Scholar
- 4.Dauchet, M., Mongy, J.: Transformations de noyaux reconnaissables d’arbres, Forêts RATEG. Ph.D. thesis, LIFL (France) (1981)Google Scholar
- 7.Héam, P.-C., Hugot, V., Kouchnarenko, O.: SAT solvers for queries over tree automata with constraints. In: ICST (CSTVA ws.), pp. 343–348. IEEE (2010)Google Scholar
- 8.Hosoya, H.: Foundations of XML Processing: The Tree-Automata Approach. Cambridge University Press (2010), http://books.google.fr/books?id=xGlH3ADxwn4C