234 search results - page 18 / 47 » On Quasi-Products of Tree Automata |
160
click to vote
LICS
2012
IEEE
13 years 3 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
111
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
121
click to vote
PODS
2008
ACM
16 years 1 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
108
click to vote
CADE
2001
Springer
15 years 5 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
117
click to vote
DBPL
2007
Springer
15 years 7 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...