Earliest Query Answering for Deterministic Nested Word Automata
From MaRDI portal
(Redirected from Earliest Query Answering for Deterministic Nested Word Automata)
Earliest Query Answering for Deterministic Nested Word Automata
Earliest Query Answering for Deterministic Nested Word Automata
Recommendations
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)