50 search results - page 2 / 10 » Querying Unranked Trees with Stepwise Tree Automata |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
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...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
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...
AMW
2011
13 years 10 hour ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...