Streaming tree automata
by
Olivier Gauwin
,
Joachim Niehren
,
Yves Roos
| Venue: | Inf. Process. Lett |
| Citations: | 6 - 4 self |
BibTeX
@ARTICLE{Gauwin_streamingtree,
author = {Olivier Gauwin and Joachim Niehren and Yves Roos},
title = {Streaming tree automata},
journal = {Inf. Process. Lett},
year = {},
pages = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 99 | P.: Visibly pushdown languages - Alur, Madhusudan - 2004 |
| 56 | Regular expressions into finite automata - Brüggemann-Klein - 1993 |
| 54 | Translations on a context-free grammar - Aho, Ullman - 1971 |
| 30 | Querying unranked trees with stepwise tree automata - Carme, Niehren, et al. - 2004 |
| 12 | Tree-walking automata do not recognize all regular languages - Bojańczyk, Colcombet - 2008 |
| 11 | Marrying words and trees - Alur - 2007 |
| 10 | Expressive Power of Pebble Automata - Bojanczyk, Samuelides, et al. |
| 9 | Binary queries for document trees - Berlea, Seidl |
