Earliest Query Answering for Deterministic Nested Word Automata
From MaRDI portal
Publication:3183602
DOI10.1007/978-3-642-03409-1_12zbMath1252.68085OpenAlexW1552999515MaRDI QIDQ3183602
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Data structures (68P05)
Related Items (9)
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Visibly pushdown transducers ⋮ Earliest query answering for deterministic stepwise hedge automata ⋮ Unnamed Item ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Streamable Fragments of Forward XPath ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ Unnamed Item ⋮ Early nested word automata for XPath query answering on XML streams
This page was built for publication: Earliest Query Answering for Deterministic Nested Word Automata
