5 search results - page 1 / 1 » Earliest Query Answering for Deterministic Nested Word Autom... |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deï...
PLANX
2008
13 years 6 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 ...
IANDC
2011
12 years 11 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
CONCUR
2006
Springer
13 years 6 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...