234 search results - page 13 / 47 » On Quasi-Products of Tree Automata |
187
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
161
click to vote
PLANX
2008
15 years 8 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
169
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
171
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
163
click to vote
SSPR
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...