Earliest Query Answering for Deterministic Nested Word Automata

DOI10.1007/978-3-642-03409-1_12MaRDI QIDQ3183602zbMATH OpenOpenAlexFDO

Authors Olivier Gauwin, Joachim Niehren, Sophie Tison

Publication date 20 October 2009

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00390236/file/0.pdf

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Early nested word automata for XPath query answering on XML streams
• Early Nested Word Automata for XPath Query Answering on XML Streams
• Bounded Delay and Concurrency for Earliest Query Answering
• Streamable fragments of forward XPath
• Queries on XML streams with bounded delay and concurrency

Cited in

(12)

• Visibly pushdown transducers
• Early nested word automata for XPath query answering on XML streams
• Query Automata for Nested Words
• Bounded Delay and Concurrency for Earliest Query Answering
• Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
• Streamable fragments of forward XPath
• Early Nested Word Automata for XPath Query Answering on XML Streams
• Streamability of nested word transductions
• Queries on XML streams with bounded delay and concurrency
• Schema-based automata determinization
• Earliest query answering for deterministic stepwise hedge automata
• Subhedge projection for stepwise hedge automata

This page was built for publication: Earliest Query Answering for Deterministic Nested Word Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183602)