662 search results - page 27 / 133 » Trees, Automata and XML |
170
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
172
click to vote
CAV
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
170
click to vote
DLT
2008
15 years 7 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
185
click to vote
IANDC
2011
15 years 1 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
156
click to vote
WIA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive a...