-
Rewrite Closure and CF Hedge Automata
International audience -
How Useful are Dag Automata?
25 pages -
Closure properties and decision problems of dag automata
Tree automata are widely used in various contexts. They are closed under boolean operations and their emptiness problem decidable in polynomial time. Dag automata are... -
Query Induction with Schema-Guided Pruning Strategies
International audience -
ACID-Unification is NEXPTIME-Decidable
28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings -
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?
International audience -
Tree Automata Completion for Static Analysis of Functional Programs
Tree Automata Completion is a family of techniques for computing or approximating the set of terms reachable by a rewriting relation. For functional programs... -
Unranked Tree Rewriting and Effective Closures of Languages
International audience -
Constructing Infinite Models Represented by Tree Automata
International audience -
Fast in-memory XPath search using compressed indexes
International audience -
A Good Class of Tree Automata
Colloque avec actes et comité de lecture. -
Decidable Approximations of Sets of Descendants and Sets of Normal forms
Colloque avec actes et comité de lecture. -
Unification in Extensions of Shallow Equational Theories
Rapport interne.
