Tree automata
Rigid Tree Automata
... rigid tree automata (RTA) by the identification of some states as rigid, and the condition that the subterms recognized in one rigid state during a computation are all ...of automata and decision ...
13
Towards Static Analysis of Functional Programs Using Tree Automata Completion
... apply tree automata completion to the static analysis of functional ...programs. Tree Automata Completion is a family of techniques for com- puting or approximating the set of terms reachable ...
16
Tree automata with equality constraints modulo equational theories
... concerning tree automata with equality constraints modulo equational ...reduction automata (see Section ...the automata of [9] in order to make emptiness and, more generally, GIP ...
28
Parametric Random Generation of Deterministic Tree Automata
... top–down tree automata obtained from transforming 100 2-letter DTWAs with n ...DTWAs. Tree-walking automata are especially useful as a means to define relations between nodes of a tree; ...
13
Combined Tractability of Query Evaluation via Tree Automata and Cycluits
... to tree automata on treelike instances was used in the context of guarded logics and other fragments, to decide satisfiability [13] and containment ...expressive automata formalisms, such ...
20
Tree Automata Make Ordinal Theory Easy
... 8. Olivier Carton and Chloe Rispal. Complementation of rational sets on scattered linear orderings of finite rank. In Martin Farach-Colton, editor, LATIN, volume 2976 of LNCS, pages 292–301. Springer, 2004. 9. Didier ...
13
Equational Approximations for Tree Automata Completion
... Experiments on non-trivial case studies (Genet et al., 2003; Boichut et al., 2007) have been carried out with an implementation of the completion algorithm in the Timbuk tool (Genet and Viet Triem Tong, 2001b). They have ...
27
Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas
... word automata for horizontal languages, since such hedge automata can be translated in linear time to stepwise tree ...hedge automata is unsatisfactory [13] so that we cannot choose B to be a ...
52
Tree automata based semantics of firewalls
... on tree automata techniques: we show that the semantics of any process composing a firewall (including the network address translation functionality) can be expressed as a regular set or relation and thus ...
17
Towards Static Analysis of Functional Programs using Tree Automata Completion
... using tree automata as the core formalism to represent or approximate the (possibly) infinite set of terms R ∗ ...a tree automaton A recognizing L0 into an automaton A ∗ recognizing exactly, or ...
16
Tree Automata Completion for Static Analysis of Functional Programs
... using tree grammars for the analysis and the former are using specific formalisms: pattern matching recursion schemes and ...since tree automata completion is based on regular languages, it cannot ...
30
A Note on the Precision of the Tree Automata Completion
... use tree automata completion to answer this kind of questions: what is the set of the results obtained by applying delete to a and to any list of a and ...
14
Handling Non Left-Linear Rules When Completing Tree Automata
... regular tree lan- guage [15, 13, 19, 22, 25, 26, ...AC-tree automata. We quote several works for tree regular model checking pro- posed in [9, 1, 8, ...
14
Tree automata with equality constraints modulo equational theories
... by tree au- tomata of [3], with equality constraints between brother positions is not closed under rewriting with shallow theories (rewrite systems whose left and right mem- bers of rules have depth ...these ...
37
Fibrations of Tree Automata
... of tree automata and acceptance games, in which the fibre categories are based on a synchronous restriction of linear simple ...non-deterministic automata of [ 4 ]. On a similar vein, connections ...
161
Rigid Tree Automata and Applications
... Example 10. The RTA of Example 3 is visibly rigid, with a function ν defined only on g by ν(g) = q r . The DRTA in the above proof of Theorem 5 is also visibly rigid, with the same function. Conversely, the RTA of ...
45
Streaming Tree Automata
... close a r e (pred (close, π)) r n (π) → r e (close, π) An example for a successful run of the STA in Fig. 3 on tree a(a(b), b) is given in Fig. 4. An STA is deterministic if it does not have two rules with the ...
7
Termination criteria for tree automata completion
... done. Tree automata ...the tree automata completion setting is that it is not necessary to provide a set of approximation equations to over-approximate the set of reachable terms, this is ...
56
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
... Introduction Tree automata are a pervasive tool of contemporary Computer Science, with applications running the gamut from XML processing [13] to program verifica- tion [3, 14, ...of tree ...
10
Monoidal-Closed Categories of Tree Automata
... tree automata. We then turn in § 3 to our notion of uniform automata (motivated by monoidal closure), and present basic material on zig-zag games required for our ...non-deterministic automata ...
140