662 search results - page 15 / 133 » Trees, Automata and XML |
112
click to vote
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
100
click to vote
IANDC
2007
15 years 1 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
143
click to vote
DOCENG
2007
ACM
15 years 6 months ago
2007
ACM
Document Object Modeling (DOM) is widely used approach for retrieving data from an XML document. If the size of the XML document is very large, however, using the DOM approach for...
102
click to vote
CSL
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
105
click to vote
ADC
2004
Springer
15 years 7 months ago
2004
Springer
Lazy DFA (Deterministic Finite Automata) approach has been recently proposed to for efficient XML stream data processing. This paper discusses the drawbacks of the approach, sugge...