12 search results - page 1 / 3 » On Nondeterministic Unranked Tree Automata with Sibling Cons... |
FSTTCS
2009
Springer
14 years 5 hour 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...
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
AMW
2011
12 years 9 months 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...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...