500 search results - page 9 / 100 » Streaming tree automata |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
AMW
2011
12 years 11 months ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
SBBD
2007
13 years 9 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
DLOG
2006
13 years 9 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...