Streaming tree automata
From MaRDI portal
Publication:975511
DOI10.1016/j.ipl.2008.08.002zbMath1191.68241MaRDI QIDQ975511
Joachim Niehren, Olivier Gauwin, Yves Roos
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.002
Related Items
Streamable Fragments of Forward XPath, Unnamed Item, Which XML schemas are streaming bounded repairable?, Descriptional complexity of unambiguous input-driven pushdown automata, Queries on XML streams with bounded delay and concurrency, Limitations of lower bound methods for deterministic nested word automata, Efficient inclusion checking for deterministic tree automata and XML schemas, Operational state complexity of nested word automata, State complexity of operations on input-driven pushdown automata, Descriptional Complexity of Input-Driven Pushdown Automata, Query Automata for Nested Words, State Complexity of Nested Word Automata, Bounded Delay and Concurrency for Earliest Query Answering
Uses Software
Cites Work