| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427927 | Information Processing Letters | 2008 | 5 Pages |
Abstract
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the two main approaches, which have not been linked so far: automata for nested words or equivalently visibly pushdown automata, and respectively pushdown forest automata.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
