Sciweavers

662 search results - page 11 / 133
» Trees, Automata and XML
Sort
View
JDCTA
2010
151views more  JDCTA 2010»
14 years 8 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
CAI
2009
Springer
15 years 8 months ago
A Backward and a Forward Simulation for Weighted Tree Automata
Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two type...
Andreas Maletti
ICWE
2005
Springer
15 years 7 months ago
An Experiment on the Matching and Reuse of XML Schemas
XML Schema is becoming an indispensable component in developing web applications. With its widespread adoption and its web accessibility, XML Schema reuse is becoming imperative. T...
Jianguo Lu, Shengrui Wang, Ju Wang
FCT
2005
Springer
15 years 7 months ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...
FSTTCS
2009
Springer
15 years 8 months ago
On Nondeterministic Unranked Tree Automata with Sibling Constraints
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
Christof Löding, Karianto Wong